# Prime Numbers and Cryptography

## 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.

## Keywords

Prime Number Encryption Algorithm Punctuation Mark Small Prime Factor Multiple Precision Arithmetic## Preview

Unable to display preview. Download preview PDF.

## Bibliography

- 1.Claude Shannon, “A Mathematical Theory of Communication,”
*Bell System Technical Journal***27**(1948) pp. 379–423 and 623–656.MathSciNetMATHGoogle Scholar - 2.Martin Gardner, “A New Kind of Cipher that Would Take Millions of Years to Break,”
*Scientific Am***237**(Aug. 1977) pp. 120–124.CrossRefGoogle Scholar - 3.W. Diffie and M. E. Hellman, “New Directions in Cryptography,”
*IEEE Trans. Inform. Theory***22**(1976) pp. 644–654.MathSciNetMATHCrossRefGoogle Scholar - 4.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.MathSciNetMATHCrossRefGoogle Scholar - 5.Alan G. Konheim,
*Cryptography: A Primer*, Wiley-Interscience, New York, 1981.MATHGoogle Scholar