Abstract
There is a remarkable disparity between the degree of difficulty of the task of multiplication and that of factorization. Multiplying integers together is a reasonable exercise for a young child if the integers are small, and it remains a very straightforward task even when the integers are very large. The reverse operation, however, that of resolving a given integer into factors, is cumbersome except for the very smallest integers and becomes nearto impossible for large numbers. This assymmetry is exploited in a new kind of cryptosystem, called RSA after its discoverers, Rivest, Shamir and Adleman. In the RSA system secrecy is provided by placing a would-be codebreaker in a situation where in principle he commands all information necessary for reading the protected message but is confronted with an arithmetic task which in practice is prohibitively time-consuming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Claude Shannon, “A Mathematical Theory of Communication,” Bell System Technical Journal 27 (1948) pp. 379–423 and 623–656.
Martin Gardner, “A New Kind of Cipher that Would Take Millions of Years to Break,” Scientific Am 237 (Aug. 1977) pp. 120–124.
W. Diffie and M. E. Hellman, “New Directions in Cryptography,” IEEE Trans. Inform. Theory 22 (1976) pp. 644–654.
R. L. Rivest, A. Shamir and L. Adleman, “A Method For Obtaining Digital Signatures and Public-Key Cryptosystems,” Comm. ACM 21 (1978) pp. 120–126.
Alan G. Konheim, Cryptography: A Primer, Wiley-Interscience, New York, 1981.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer Science+Business Media New York
About this chapter
Cite this chapter
Riesel, H. (1985). Prime Numbers and Cryptography. In: Prime Numbers and Computer Methods for Factorization. Progress in Mathematics, vol 57. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-1089-2_6
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1089-2_6
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4757-1091-5
Online ISBN: 978-1-4757-1089-2
eBook Packages: Springer Book Archive