Primality Testing and Integer Factorization in Public-Key Cryptography
Although the Primality Testing Problem (PTP) has been proved to be solvable in deterministic polynomial-time (P) in 2002 by Agrawal, Kayal and Saxena, the Integer Factorization Problem (IFP) still remains unsolvable in P. The security of many practical Public-Key Cryptosystems and Protocols such as...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer US
2009, 2009
|
| Edition: | 2nd ed. 2009 |
| Series: | Advances in Information Security
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- Number-Theoretic Preliminaries
- Primality Testing and Prime Generation
- Integer Factorization and Discrete Logarithms
- Number-Theoretic Cryptography