Cover image for Cryptology and computational number theory
Title:
Cryptology and computational number theory
Series:
Proceedings of symposia in applied mathematics ; 42
Publication Information:
Providence, R.I. : American Mathematical Society, 1990
ISBN:
9780821801550

Available:*

Library
Item Barcode
Call Number
Material Type
Status
Searching...
30000002572810 QA76.9.A25 C79 1990 Open Access Book
Searching...

On Order

Summary

Summary

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.