Primality Testing And Integer Factorization In Public-Key Cryptography, 2Nd Edition (Advances In Information Security , Volume 11)

Yan Song Y.

ISBN 10: 0387772677 / ISBN 13: 9780387772677

Editore: Springer, 2008

Riguardo questo articolo

New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-88151

Dati bibliografici

Titolo: Primality Testing And Integer Factorization ...

Casa editrice: Springer

Data di pubblicazione: 2008

Legatura: Rilegato

Condizione: Brand New

Edizione: seconda edizione

Descrizione articolo

Riassunto:

Intended for advanced level students in computer science and mathematics, this key text, now in a brand new edition, provides a survey of recent progress in primality testing and integer factorization, with implications for factoring based public key cryptography. For this updated and revised edition, notable new features include a comparison of the Rabin-Miller probabilistic test in RP, the Atkin-Morain elliptic curve test in ZPP and the AKS deterministic test.

Dalla quarta di copertina:

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.