Primality Testing and Integer Factorization in Public-Key Cryptography: v. 11 (Advances in Information Security) - Hardcover

Book 58 of 90: Advances in Information Security

Yan, Song Y.

 
9781402076497: Primality Testing and Integer Factorization in Public-Key Cryptography: v. 11 (Advances in Information Security)

Synopsis

"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.

"synopsis" may belong to another edition of this title.

About the Author

Song Yan is currently with the School of Mathematical and Information Sciences at Coventry University England.

"About this title" may belong to another edition of this title.

Other Popular Editions of the Same Title