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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Yan, Song Y. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer US : Imprint: Springer, 2009.
Edición:2nd ed. 2009.
Colección:Advances in Information Security, 11
Temas:
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.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Number-Theoretic Preliminaries
  • Primality Testing and Prime Generation
  • Integer Factorization and Discrete Logarithms
  • Number-Theoretic Cryptography.

Ejemplares similares