Primality testing and integer factorization in public-key cryptography
Auteur :
Yan, Song Y.
Éditeur :
Springer-Verlag New York Inc.
ISBN :
9781441945860
Date de publication :
29 nov. 2010
Dimensions :
23,5 x 15,5 cm
Langue :
Anglais
Pays d'origine :
USA
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).