Overview
- New section on quantum factoring and post-quantum cryptography
- Exercises and research problems grouped into new section after each chapter; thus more suitable as advanced graduate text
Part of the book series: Advances in Information Security (ADIS, volume 11)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (4 chapters)
Keywords
About this book
The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.
Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides a survey of recent progress in primality testing and integer factorization, with implications to factoring based public key cryptography. Notable new features are the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test.
This volume is designed for advanced level students in computer science and mathematics, and as a secondary text or reference book; suitable for practitioners and researchers in industry.
Reviews
From the reviews of the second edition:
"The well-written and self-contained second edition ‘is designed for a professional audience composed of researchers practitioners in industry.’ In addition, ‘this book is also suitable as a secondary text for graduate-level students in computer science, mathematics, and engineering,’ as it contains about 300 problems. … Overall … ‘this monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications in factoring-based Public Key Cryptography.’" (Hao Wang, ACM Computing Reviews, April, 2009)
“This is the second edition of a book originally published in 2004. … I used it as a reference in preparing lectures for an advanced cryptography course for undergraduates, and it proved to be a wonderful source for a general description of the algorithms. … the book will be a valuable addition to any good reference library on cryptography and number theory … . It contains descriptions of all the main algorithms, together with explanations of the key ideas behind them.” (S. C. Coutinho, SIGACT News, April, 2012)
Authors and Affiliations
Bibliographic Information
Book Title: Primality Testing and Integer Factorization in Public-Key Cryptography
Authors: Song Y. Yan
Series Title: Advances in Information Security
DOI: https://doi.org/10.1007/978-0-387-77268-4
Publisher: Springer New York, NY
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag US 2009
Hardcover ISBN: 978-0-387-77267-7Published: 02 December 2008
Softcover ISBN: 978-1-4419-4586-0Published: 29 November 2010
eBook ISBN: 978-0-387-77268-4Published: 03 April 2009
Series ISSN: 1568-2633
Series E-ISSN: 2512-2193
Edition Number: 2
Number of Pages: XVIII, 371
Number of Illustrations: 40 b/w illustrations
Topics: Cryptology, Number Theory, Mathematics of Computing, Data Structures and Information Theory, Systems and Data Security, Coding and Information Theory