Primality Testing and Integer Factorization in Public-Key Cryptography Primality Testing and Integer Factorization in Public-Key Cryptography
Advances in Information Security

Primality Testing and Integer Factorization in Public-Key Cryptography

    • $149.99
    • $149.99

Publisher Description

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 RSA (invented by Rivest, Shamir and Adleman) relies on the computational intractability of IFP. This monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications to factoring-based Public Key Cryptography.


Notable features of this second edition are the several new sections and more than 100 new pages that are added. These include a new section in Chapter 2 on the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test in P; a new section in Chapter 3 on recent work in quantum factoring; and a new section in Chapter 4 on post-quantum cryptography.


To make the book suitable as an advanced undergraduate and/or postgraduate text/reference, about ten problems at various levels of difficulty are added at the end of each section, making about 300 problems in total contained in the book; most of the problems are research-oriented with prizes ordered by individuals or organizations to a total amount over five million US dollars.


Primality Testing and Integer Factorization in Public Key Cryptography is designed for practitioners and researchers in industry and graduate-level students in computer science and mathematics.

GENRE
Computers & Internet
RELEASED
2009
April 3
LANGUAGE
EN
English
LENGTH
389
Pages
PUBLISHER
Springer US
SELLER
Springer Nature B.V.
SIZE
34.8
MB
Integer Algorithms In Cryptology And Information Assurance Integer Algorithms In Cryptology And Information Assurance
2014
An Introduction to Number Theory with Cryptography An Introduction to Number Theory with Cryptography
2018
Cryptanalytic Attacks on RSA Cryptanalytic Attacks on RSA
2007
Cybercryptography: Applicable Cryptography for Cyberspace Security Cybercryptography: Applicable Cryptography for Cyberspace Security
2018
Arithmetic of Finite Fields Arithmetic of Finite Fields
2007
Algorithmic Number Theory Algorithmic Number Theory
2008
Computational Number Theory and Modern Cryptography Computational Number Theory and Modern Cryptography
2012
Cybercryptography: Applicable Cryptography for Cyberspace Security Cybercryptography: Applicable Cryptography for Cyberspace Security
2018
Quantum Computational Number Theory Quantum Computational Number Theory
2015
Quantum Attacks on Public-Key Cryptosystems Quantum Attacks on Public-Key Cryptosystems
2014
Cryptanalytic Attacks on RSA Cryptanalytic Attacks on RSA
2007
Identifying Malicious Code Through Reverse Engineering Identifying Malicious Code Through Reverse Engineering
2009
Cyber-security of SCADA and Other Industrial Control Systems Cyber-security of SCADA and Other Industrial Control Systems
2016
Security for Telecommunications Networks Security for Telecommunications Networks
2008
Data Warehousing and Data Mining Techniques for Cyber Security Data Warehousing and Data Mining Techniques for Cyber Security
2007
Cyber Defense and Situational Awareness Cyber Defense and Situational Awareness
2015
Network Security Policies and Procedures Network Security Policies and Procedures
2007