Primality Testing and Integer Factorization in Public-Key Cryptography
Although the Primality Testing Problem (PTP) has been proved to be solvable in deterministic polynomial-time (P) in 2002 by Agrawal, Kayal and Saxena, the Integer Factorization Problem (IFP) still remains unsolvable in P. The security of many practical Public-Key Cryptosystems and Protocols such as...
|Main Author:||Yan, Song Y.|
|Corporate Author:||SpringerLink (Online service)|
Boston, MA :
Springer US :
Advances in Information Security,
No Tags, Be the first to tag this record!