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...

Full description

Main Author: Yan, Song Y.
Corporate Author: SpringerLink (Online service)
Format: Electronic
Language: English
Published: Boston, MA : Springer US : 2009.
Series: Advances in Information Security, 11
Subjects:
Online Access: http://dx.doi.org/10.1007/978-0-387-77268-4
Tags: Add Tag
No Tags, Be the first to tag this record!