Gå direkt till innehållet
Primality Testing and Integer Factorization in Public-Key Cryptography
Spara

Primality Testing and Integer Factorization in Public-Key Cryptography

Lägsta pris på PriceRunner

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
Softcover reprint of hardcover 2nd ed. 2009
ISBN
9781441945860
Språk
Engelska
Vikt
310 gram
Utgivningsdatum
2010-11-29
Sidor
371