This collection of articles grew out of an expository and tutorial conference on public-key cryptography held at the Joint Mathematics Meetings (Baltimore).

The book provides an introduction and survey on public-key cryptography for those with considerable mathematical maturity and general mathematical knowledge. Its goal is to bring visibility to the cryptographic issues that fall outside the scope of standard mathematics.

These mathematical expositions are intended for experienced mathematicians who are not well acquainted with the subject. The book is suitable for graduate students, researchers, and engineers interested in mathematical aspects and applications of public-key cryptography.

Readership

Graduate students, research mathematicians, and engineers interested in mathematical aspects and applications of public-key cryptography.

Table of Contents

• P. Garrett -- Cryptographic primitives
• D. Lieman -- Cryptography in the real world today
• N. Howgrave-Graham -- Public-key cryptography and proofs of security
• J. H. Silverman -- Elliptic curves and cryptography
• W. Whyte -- Towards faster cryptosystems I
• W. D. Banks -- Towards faster cryptosystems, II
• I. E. Shparlinski -- Playing "hide-and-seek" with numbers: The hidden number problem, lattices and exponential sums
• Index