
Proceedings of Symposia in Applied Mathematics 1990; 172 pp; softcover Volume: 42 ISBN10: 0821843109 ISBN13: 9780821843109 List Price: US$53 Member Price: US$42.40 Order Code: PSAPM/42.D Suggest to a Colleague Please note that AMS On Demand titles are not returnable.  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 theorybased 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. 


AMS Home 
Comments: webmaster@ams.org © Copyright 2014, American Mathematical Society Privacy Statement 