Tallenna
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).
- Kirjailija
- Song Y. Yan
- Painos
- Softcover reprint of hardcover 2nd ed. 2009
- ISBN
- 9781441945860
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 29.11.2010
- Kustantaja
- Springer-Verlag New York Inc.
- Sivumäärä
- 371
