Stronger Security Proofs for RSA and Rabin Bits
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 267-279
- https://doi.org/10.1007/3-540-69053-0_19
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome DecodingPublished by Springer Nature ,1996
- The discrete logarithm modulo a composite hides 0(n) BitsJournal of Computer and System Sciences, 1993
- Factoring integers with the number field sievePublished by Springer Nature ,1993
- Efficient, perfect polynomial random number generatorsJournal of Cryptology, 1991
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- On the cryptographic security of single RSA bitsPublished by Association for Computing Machinery (ACM) ,1983
- 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