Cover Image

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

Bibliographic Details
Main Author: Yan, Song Y. (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic
Language:English
Published: Boston, MA : Springer US : Imprint: Springer, 2009.
Series:Advances in Information Security, 11
Subjects:
Computer science.
Computer Communication Networks.
Data protection.
Data structures (Computer science).
Data encryption (Computer science).
Coding theory.
Computer Science.
Data Encryption.
Data Structures, Cryptology and Information Theory.
Systems and Data Security.
Coding and Information Theory.
Data Structures.
Online Access:https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-0-387-77268-4

Fulltext / Holdings URL

https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-0-387-77268-4

Similar Items