Gå direkte til innholdet
Primality Testing and Integer Factorization in Public-Key Cryptography
Spar

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

Forfatter
Song Y. Yan
Opplag
Softcover reprint of hardcover 2nd ed. 2009
ISBN
9781441945860
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
29.11.2010
Antall sider
371