- イーブック ￥9,151
価格の適用国: Japan (日本円価格は個人のお客様のみ有効) (小計)
- ISBN 978-1-4757-3816-2
- ウォーターマーク付、 DRMフリー
- ファイル形式: PDF
Primality Testing and Integer Factorization in Public-Key Cryptography
Song Y. Yan
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.
From the reviews of the second edition:
"The well-written and self-contained second edition ‘is designed for a professional audience composed of researchers practitioners in industry.’ In addition, ‘this book is also suitable as a secondary text for graduate-level students in computer science, mathematics, and engineering,’ as it contains about 300 problems. … Overall … ‘this monograph provides a survey of recent progress in Primality Testing and Integer Factorization, with implications in factoring-based Public Key Cryptography.’" (Hao Wang, ACM Computing Reviews, April, 2009)
- Table of contents (4 chapters)
Primality Testing and Prime Generation
Integer Factorization and Discrete Logarithms
Table of contents (4 chapters)
- Bibliographic Information
- Book Title
- Primality Testing and Integer Factorization in Public-Key Cryptography
- Song Y. Yan
- Series Title
- Advances in Information Security
- Series Volume
- Springer US
- Copyright Holder
- Springer Science+Business Media New York
- イーブック ISBN
- Series ISSN
- Edition Number
- Number of Pages
- XVI, 237
- Number of Illustrations
- 5 b/w illustrations
*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works are not included.