Computer Security and Cryptography

REFERENCES

J. DELAURENTIS, “A Further Weakness in the Common Modulus Protocol for the RSA Cryptoalgorithm,” Cryptologia, 8, 253–259 (1984).

N. KOBLITZ, A Course in Number Theory and Cryptography, Springer-Verlag, New York, 1987.

J. LINN, “Privacy Enhancement for Internet Electronic Mail,”, RFC 1113, Internet Engineering Task Force (IETE), August 1989.

R. L. RIVEST, A. SHAMIR, AND L. ADELMAN, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, 21, 120–126 (1978).

G. J. SIMMONS, “A Weak Privacy Protocol Using the RSA Algorithm,” Cryptologia, 7, 180–182 (1983).

H. C. WILLIAMS “A Modification of the RSA Public-Key Encryption,” IEEE Transactions on Information Theory, IT-26, 726–729 (1980).

H. RIESEL, Prime Numbers and Compute Methods for Factorization (2nd edn), Birhäuser, Cambridge, Massachusetts, 1985.

A. J. MENEZES, P. C. VAN DORSCHOT, AND S. A. VANSTONE, Handbook of Applied Cryptography, CRC Press, Boca Raton, Florida, 1996.

¹The GNU Multiple Precision Arithmetic Library, which is described at www.swox.comb/gmp, refers to the digits as limbs. A number x referred to as mpz_t has a sign, a number of limbs_mp_size, and, if this last number is positive, a pointer to a dynamically allocated array for _mp_d data.

Computer Security and Cryptography. By Alan G. KonheimCopyright © 2007 John Wiley & Sons, Inc.