株式会社極東書店トップ ＞ 商品一覧 ＞ Primality Testing and Integer Factorization in Public-Key Cryptography. 2nd ed. 2009
商品詳細
Primality Testing and Integer Factorization in Public-Key Cryptography. 2nd ed. 2009
・ISBN 978-0-387-77267-7 hard EUR 149.99
￥40,091.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
| 著者・編者 | Yan, Song Y., |
|---|---|
| シリーズ | (Advances in Information Security) |
| 出版社 | (Springer-Verlag New York Inc., US) |
| 出版年月 | 2008 |
| ページ数 | 371 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A05-43898＞ |
解説
The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.
Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides a survey of recent progress in primality testing and integer factorization, with implications to factoring based public key cryptography. Notable new features are the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test.
This volume is designed for advanced level students in computer science and mathematics, and as a secondary text or reference book; suitable for practitioners and researchers in industry.