Primality Testing and Integer Factorization in Public-Key Cryptography

• Κύριος συγγραφέας: Yan, Song Y. (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Boston, MA : Springer US : Imprint: Springer, 2009.
• Σειρά: Advances in Information Security, 11
• Θέματα: Computer science.; Computer security.; Data structures (Computer science).; Data encryption (Computer science).; Coding theory.; Computer science > Mathematics.; Number theory.; Computer Science.; Data Encryption.; Number Theory.; Mathematics of Computing.; Data Structures, Cryptology and Information Theory.; Systems and Data Security.; Coding and Information Theory.

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

Πίνακας περιεχομένων:

• Number-Theoretic Preliminaries
• Primality Testing and Prime Generation
• Integer Factorization and Discrete Logarithms
• Number-Theoretic Cryptography.