## A method for obtaining digital signatures and public-key cryptosystems.(English)Zbl 0368.94005

### MathOverflow Questions:

Who first chose the names Alice and Bob for players A and B?

### MSC:

 94A60 Cryptography 94A62 Authentication, digital signatures and secret sharing 68P25 Data encryption (aspects in computer science)
Full Text:

### References:

 [1] Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun ACM, 1978, 21: 120-126 · Zbl 0368.94005 [2] Coppersmith D. Finding a small root of a univariate modular equation. In: Proceedings of International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, 1996. 155-165 · Zbl 1304.94042 [3] Coppersmith D. Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J Cryptol, 1997, 10: 233-260 · Zbl 0912.11056 [4] Howgrave-Graham N. Finding small roots of univariate modular equations revisited. In: Darnell M, ed. Crytography and Coding. Berlin: Springer, 1997. 131-142 · Zbl 0922.11113 [5] Wiener M J. Cryptanalysis of short RSA secret exponents. IEEE Trans Inform Theory, 1990, 36: 553-558 · Zbl 0703.94004 [6] Boneh D, Durfee G. Cryptanalysis of RSA with private key $$d$$ less than $$N^{0.292}$$. In: Proceedings of International Conference on the Theory and Application of Cryptographic Techniques, Prague, 1999. 1-11 · Zbl 0948.94009 [7] Boneh D, Durfee G. Cryptanalysis of RSA with private key $$d$$ less than $$N^{0.292}$$. IEEE Trans Inform Theory, 2000, 46: 1339-1349 · Zbl 1001.94031 [8] Blömer J, May A. Low secret exponent RSA revisited. In: Silverman J H, ed. Cryptography and Lattices. Berlin: Springer, 2001. 4-19 · Zbl 1006.11082 [9] Blömer J, May A. New partial key exposure attacks on RSA. In: Proceedings of 23rd Annual International Cryptology Conference, Santa Barbara, 2003. 27-43 · Zbl 1122.94353 [10] Ernst M, Jochemsz E, May A, et al. Partial key exposure attacks on RSA up to full size exponents. In: Proceedings of 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, 2005. 371-386 · Zbl 1137.94343 [11] Aono Y. A new lattice construction for partial key exposure attack for RSA. In: Proceedings of 12th International Conference on Practice and Theory in Public Key Cryptography, Irvine, 2009. 34-53 · Zbl 1220.94032 [12] Sarkar S. Partial key exposure: generalized framework to attack RSA. In: Proceedings of 12th International Conference on Cryptology in India, Chennai, 2011. 76-92 · Zbl 1291.94149 [13] Joye M, Lepoint T. Partial key exposure on RSA with private exponents larger than $$N$$. In: Ryan M D, Smyth B, Wang G L, eds. Information Security Practice and Experience. Berlin: Springer, 2012. 369-380 · Zbl 1291.94108 [14] Takagi T. Fast RSA-type cryptosystem modulo $$p^kq$$. In: Proceedings of 18th Annual International Cryptology Conference, Santa Barbara, 1998. 318-326 · Zbl 0931.94041 [15] Boneh D, Durfee G, Howgrave-Graham N. Factoring $$N = p^rq$$ for large $$r$$. In: Proceedings of 19th Annual International Cryptology Conference, Santa Barbara, 1999. 326-337 · Zbl 1007.11077 [16] May A. Secret exponent attacks on RSA-type schemes with moduli $$N = p^rq$$. In: Proceedings of 7th International Workshop on Theory and Practice in Public Key Cryptography, Singapore, 2004. 218-230 · Zbl 1198.94113 [17] Sarkar S. Small secret exponent attack on RSA variant with modulus $$N = p^rq$$. Designs Codes Cryptogr, 2014, 73: 383-392 · Zbl 1335.94076 [18] Itoh K, Kunihiro N, Kurosawa K. Small secret key attack on a variant of RSA (due to Takagi). In: Proceedings of the Cryptographers’ Track at the RSA Conference, San Francisco, 2008. 387-406 · Zbl 1161.94408 [19] Takayasu A, Kunihiro N. Better lattice constructions for solving multivariate linear equations modulo unknown divisors. In: Proceedings of 18th Australasian Conference, ACISP 2013, Brisbane, 2013. 118-135 · Zbl 1316.94090 [20] Lenstra A K,
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.