Siirry suoraan sisältöön
Primality Testing and Integer Factorization in Public-Key Cryptography
Tallenna

Primality Testing and Integer Factorization in Public-Key Cryptography

Kirjailija:
sidottu, 2008
englanti

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
2nd ed. 2009
ISBN
9780387772677
Kieli
englanti
Paino
446 grammaa
Julkaisupäivä
2.12.2008
Sivumäärä
371