Primality Testing And Integer Factorization In Public Key Cryptography
Download and Read Primality Testing And Integer Factorization In Public Key Cryptography full books in PDF, ePUB, and Kindle. Read online free Primality Testing And Integer Factorization In Public Key Cryptography ebook anywhere anytime directly on your device. We cannot guarantee that every ebooks is available!
Primality Testing and Integer Factorization in Public-Key Cryptography
Author | : Song Y. Yan |
Publisher | : Springer Science & Business Media |
Total Pages | : 249 |
Release | : 2013-06-29 |
Genre | : Computers |
ISBN | : 1475738161 |
Download Primality Testing and Integer Factorization in Public-Key Cryptography Book in PDF, Epub and Kindle
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.
Primality Testing and Integer Factorization in Public-Key Cryptography Related Books
Pages: 249
Pages: 104
Pages: 250
Pages: 631
Pages: 432