RSA/Rabin least significant bits are $$ \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} $$ secure (Extended Abstract)
- 24 November 2000
- book chapter
- Published by Springer Nature
- p. 303-313
- https://doi.org/10.1007/3-540-39568-7_24
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- RSA bits are .732 + ε securePublished by Springer Nature ,1984
- On the cryptographic security of single RSA bitsPublished by Association for Computing Machinery (ACM) ,1983
- How discreet is the discrete log?Published by Association for Computing Machinery (ACM) ,1983
- Comparison of Two Pseudo-Random Number GeneratorsPublished by Springer Nature ,1983
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- 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