Primality Testing and Integer Factorization in Public-Key Cryptography introduces various algorithms for primality testing and integer factorization, with their applications in public-key cryptography and information security. More specifically, this book explores basic concepts and results in number theory in Chapter 1. Chapter 2 discusses various algorithms for primality testing and prime number generation, with an emphasis on the Miller-Rabin probabilistic test, the Goldwasser-Kilian and Atkin-Morain elliptic curve tests, and the Agrawal-Kayal-Saxena deterministic test for primality. Chapter 3 introduces various algorithms, particularly the Elliptic Curve Method (ECM), the Quadratic Sieve (QS) and the Number Field Sieve (NFS) for integer factorization. This chapter also discusses some other computational problems that are related to factoring, such as the square root problem, the discrete logarithm problem and the quadratic residuosity problem.
Rezensionen / Stimmen
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)
Reihe
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
5
5 s/w Abbildungen
XVI, 237 p. 5 illus.
Dateigröße
ISBN-13
978-1-4757-3816-2 (9781475738162)
DOI
10.1007/978-1-4757-3816-2
Schweitzer Klassifikation
1. Number-Theoretic Preliminaries.- 2. Primality Testing and Prime Generation.- 3. Integer Factorization and Discrete Logarithms.- 4. Number-Theoretic Cryptography.
