Can I read Primality Testing and Integer Factorization in Public-Key Cryptography Second Edition on EtoBox?

Primality Testing and Integer Factorization in Public-Key Cryptography Second Edition by Song Y. Yan (auth.) is a nonfiction available to read on EtoBox.

What is Primality Testing and Integer Factorization in Public-Key Cryptography Second Edition about?

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 th

Who reads Primality Testing and Integer Factorization in Public-Key Cryptography Second Edition?

Author

Song Y. Yan (auth.)

Publisher

Springer Science+Business Media,LLC

Published

2009

Language

EN

ISBN

9780387772677

Category

nonfiction

Subjects

Science, Management, Computer Science