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

Primality Testing and Integer Factorization in Public-Key Cryptography

Forfatter:
innbundet, 2008
Engelsk

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
2nd ed. 2009
ISBN
9780387772677
Språk
Engelsk
Vekt
446 gram
Utgivelsesdato
2.12.2008
Antall sider
371