This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
7.6 Summary and Bibliographic Remarks
L. Adleman and M. Huang. Recognizing primes in random polynomial time. In Proceedings of the 19th ACM Symposium on Theory of Computing, pages 462–469. ACM Press, May 1987.
L. Adleman and M. Huang. Primality Testing and Abelian Varieties over Finite Fields. Springer-Verlag Lecture Notes in Mathematics #1512, Berlin, Heidelberg, New York, 1992.
M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Unpublished manuscript, August 2002.
D. Boneh and G. Durfee. Cryptanalysis of RSA with private key d less than N0.292. IEEE Transactions on Information Theory, IT-46, 2000.
D. Bernstein. Distinguishing prime numbers from composite numbers: The state of the art in 2004. Manuscript at http://cr.yp.to/primetests.html, 2004.
D. Bleichenbacher. Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1. In Advances in Cryptology — CRYPTO’ 98, pages 1–12. Springer-Verlag Lecture Notes in Computer Science #1462, August 1998.
J. Blömer and A. May. A generalized Wiener attack on RSA. In Seventh International Workshop on Practice and Theory in Public-Key Cryptography, pages 1–13. Springer-Verlag Lecture Notes in Computer Science #2947, 2004.
D. Boneh. Twenty years of attacks on the RSA cryptosystem. Notices of the AMS, 46(2):203–213, February 1999.
J. Buchmann. Introduction to Cryptography. Undergraduate Texts in Mathematics. Springer-Verlag, 2001.
D. Coppersmith. Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology, 10(4):233–260, 1997.
J. Cai and R. Threlfall. A note on quadratic residuosity and UP. Information Processing Letters, 92(3):127–131, 2004.
W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644–654, 1976.
M. Dietzfelbinger. Primality Testing in Polynomial Time: From Randomized Algorithms to “PRIMES is in P”. Tutuorial. Springer-Verlag Lecture Notes in Computer Science #3000, Berlin, Heidelberg, New York, 2004.
J. Dixon. Asymptotically fast factorization of integers. Mathematics of Computation, 36:255–260, 1981.
M. Fellows and N. Koblitz. Self-witnessing polynomial-time complexity and prime factorization. Designs, Codes and Cryptography, 2(3):231–235, 1992.
O. Goldreich. Foundations of Cryptography. Cambridge University Press, 2001.
J. Håstad. Solving simultaneous modular equations of low degree. SIAM Journal on Computing, 17(2):336–341, April 1988. Special issue on cryptography.
N. Koblitz. Algebraic Aspects of Cryptography, volume 3 of Algorithms and Computation in Mathematics. Springer-Verlag, 1997.
B. Kaliski Jr. and M. Robshaw. The secure use of RSA. CryptoBytes, 1(3):7–13, 1995.
N. Kayal and N. Saxena. On the ring isomorphism & automorphism problems. Technical Report TR04-109, Electronic Colloquium on Computational Complexity, October 2004.
H. Lenstra Jr. Factoring integers with elliptic curves. Annals of Mathematics, 126:649–673, 1987.
A. Lenstra and H. Lenstra, Jr. The Development of the Number Field Sieve, volume 1554 of Lecture Notes in Mathematics. Springer-Verlag, 1993.
A. May. Computing the RSA secret key is deterministic polynomial time equivalent to factoring. In Advances in Cryptology — CRYPTO’ 04, pages 213–219. Springer-Verlag Lecture Notes in Computer Science #3152, 2004.
G. Miller. Riemann's hypothesis and tests for primality. Journal of Computer and System Sciences, 13:300–317, 1976.
J. Moore. Protocol failures in cryptosystems. In G. Simmons, editor, Contemporary Cryptology: The Science of Information Integrity, pages 541–558. IEEE Computer Society Press, 1992.
J. Pollard. Theorems on factorization and primality testing. Proc. Cambridge Philos. Soc., 76:521–528, 1974.
M. Rabin. Probabilistic algorithms for testing primality. Journal of Number Theory, 12:128–138, 1980.
J. Rothe. Some facets of complexity theory and cryptography: A five-lecture tutorial. ACM Computing Surveys, 34(4):504–549, December 2002.
R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signature and public-key cryptosystems. Communications of the ACM, 21(2):120–126, 1978.
A. Salomaa. Public-Key Cryptography, volume 23 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, second edition, 1996.
C. Schnorr and H. Hörner. Attacking the Chor—Rivest cryptosystem by improved lattice reduction. In Advances in Cryptology — EUROCRYPT’ 89, pages 1–12. Springer-Verlag Lecture Notes in Computer Science #921, May 1995.
A. Shamir. RSA for paranoids. CryptoBytes, 1(3):1–4, 1995.
S. Singh. The Code Book. The Science of Secrecy from Ancient Egypt to Quantum Cryptography. Fourth Estate, London, 1999.
G. Simmons and M. Norris. Preliminary comments on the MIT public-key cryptosystem. Cryptologia, 1(4):406–414, 1977.
R. Solovay and V. Strassen. A fast Monte Carlo test for primality. SIAM Journal on Computing, 6:84–85, 1977. Erratum appears in the same journal, 7(1):118, 1978.
D. Stinson. Cryptography: Theory and Practice. CRC Press, Boca Raton, second edition, 2002.
M. Wiener. Cryptanalysis of short RSA secret exponents. IEEE Transactions on Information Theory, IT-36(3):553–558, 1990.
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2005). RSA Cryptosystem, Primality, and Factoring. In: Complexity Theory and Cryptology. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28520-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-28520-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22147-0
Online ISBN: 978-3-540-28520-5
eBook Packages: Computer ScienceComputer Science (R0)