RSA and Rabin Functions: Certain Parts are as Hard as the Whole
- 1 April 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (2), 194-209
- https://doi.org/10.1137/0217013
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The Bit Security of Modular Squaring given Partial Factorization of the ModulosPublished by Springer Science and Business Media LLC ,2000
- On the Number of Close-and-Equal Pairs of Bits in a String (with Implications on the Security of RSA’s L.S.B) (Extended Abstract)Published by Springer Science and Business Media LLC ,2000
- RSA/Rabin least significant bits are $$ \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} $$ secure (Extended Abstract)Published by Springer Science and Business Media LLC ,2000
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial InformationPublished by Springer Science and Business Media LLC ,2000
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Why and how to establish a private code on a public networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976