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

Description complète

Détails bibliographiques
Cote:Libro Electrónico
Auteur principal: Yan, Song Y. (Auteur)
Collectivité auteur: SpringerLink (Online service)
Format: Électronique eBook
Langue:Inglés
Publié: New York, NY : Springer US : Imprint: Springer, 2009.
Édition:2nd ed. 2009.
Collection:Advances in Information Security, 11
Sujets:
Cryptography.
Data encryption (Computer science).
Number theory.
Computer science-Mathematics.
Data structures (Computer science).
Information theory.
Data protection.
Coding theory.
Cryptology.
Number Theory.
Mathematics of Computing.
Data Structures and Information Theory.
Data and Information Security.
Coding and Information Theory.
Accès en ligne:Texto Completo

Internet

Texto Completo

Items no disponibles

Informations d'exemplaires de

Documents similaires