Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Cryptology and Computational Number Theory
 
Edited by: Carl Pomerance University of Georgia, Athens, GA
Cryptology and Computational Number Theory
eBook ISBN:  978-0-8218-9257-2
Product Code:  PSAPM/42.E
List Price: $99.00
MAA Member Price: $89.10
AMS Member Price: $79.20
Cryptology and Computational Number Theory
Click above image for expanded view
Cryptology and Computational Number Theory
Edited by: Carl Pomerance University of Georgia, Athens, GA
eBook ISBN:  978-0-8218-9257-2
Product Code:  PSAPM/42.E
List Price: $99.00
MAA Member Price: $89.10
AMS Member Price: $79.20
  • Book Details
     
     
    Proceedings of Symposia in Applied Mathematics
    Volume: 421991; 171 pp
    MSC: Primary 11; 94;

    In the past dozen or so years, cryptology and computational number theory have become increasingly intertwined. Because the primary cryptologic application of number theory is the apparent intractability of certain computations, these two fields could part in the future and again go their separate ways. But for now, their union is continuing to bring ferment and rapid change in both subjects.

    This book contains the proceedings of an AMS Short Course in Cryptology and Computational Number Theory, held in August 1989 during the Joint Mathematics Meetings in Boulder, Colorado. These eight papers by six of the top experts in the field will provide readers with a thorough introduction to some of the principal advances in cryptology and computational number theory over the past fifteen years. In addition to an extensive introductory article, the book contains articles on primality testing, discrete logarithms, integer factoring, knapsack cryptosystems, pseudorandom number generators, the theoretical underpinnings of cryptology, and other number theory–based cryptosystems. Requiring only background in elementary number theory, this book is aimed at nonexperts, including graduate students and advanced undergraduates in mathematics and computer science.

  • Table of Contents
     
     
    • Articles
    • Carl Pomerance — Cryptology and computational number theory—an introduction [ MR 1095548 ]
    • Arjen K. Lenstra — Primality testing [ MR 1095549 ]
    • Carl Pomerance — Factoring [ MR 1095550 ]
    • Kevin S. McCurley — The discrete logarithm problem [ MR 1095551 ]
    • A. M. Odlyzko — The rise and fall of knapsack cryptosystems [ MR 1095552 ]
    • Shafi Goldwasser — The search for provably secure cryptosystems [ MR 1095553 ]
    • J. C. Lagarias — Pseudorandom number generators in cryptography and number theory [ MR 1095554 ]
    • Kevin S. McCurley — Odds and ends from cryptology and computational number theory [ MR 1095555 ]
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 421991; 171 pp
MSC: Primary 11; 94;

In the past dozen or so years, cryptology and computational number theory have become increasingly intertwined. Because the primary cryptologic application of number theory is the apparent intractability of certain computations, these two fields could part in the future and again go their separate ways. But for now, their union is continuing to bring ferment and rapid change in both subjects.

This book contains the proceedings of an AMS Short Course in Cryptology and Computational Number Theory, held in August 1989 during the Joint Mathematics Meetings in Boulder, Colorado. These eight papers by six of the top experts in the field will provide readers with a thorough introduction to some of the principal advances in cryptology and computational number theory over the past fifteen years. In addition to an extensive introductory article, the book contains articles on primality testing, discrete logarithms, integer factoring, knapsack cryptosystems, pseudorandom number generators, the theoretical underpinnings of cryptology, and other number theory–based cryptosystems. Requiring only background in elementary number theory, this book is aimed at nonexperts, including graduate students and advanced undergraduates in mathematics and computer science.

  • Articles
  • Carl Pomerance — Cryptology and computational number theory—an introduction [ MR 1095548 ]
  • Arjen K. Lenstra — Primality testing [ MR 1095549 ]
  • Carl Pomerance — Factoring [ MR 1095550 ]
  • Kevin S. McCurley — The discrete logarithm problem [ MR 1095551 ]
  • A. M. Odlyzko — The rise and fall of knapsack cryptosystems [ MR 1095552 ]
  • Shafi Goldwasser — The search for provably secure cryptosystems [ MR 1095553 ]
  • J. C. Lagarias — Pseudorandom number generators in cryptography and number theory [ MR 1095554 ]
  • Kevin S. McCurley — Odds and ends from cryptology and computational number theory [ MR 1095555 ]
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.