
Primality Testing and Integer Factorization in Public-Key Cryptography
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).
- Författare
- Song Y. Yan
- Upplaga
- 2nd ed. 2009
- ISBN
- 9780387772677
- Språk
- Engelska
- Vikt
- 446 gram
- Utgivningsdatum
- 2008-12-02
- Sidor
- 371
