| 书目名称 | Primality Testing and Integer Factorization in Public-Key Cryptography |
| 编辑 | Song Y. Yan |
| 视频video | |
| 概述 | New section on quantum factoring and post-quantum cryptography.Exercises and research problems grouped into new section after each chapter; thus more suitable as advanced graduate text |
| 丛书名称 | Advances in Information Security |
| 图书封面 |  |
| 描述 | .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.. |
| 出版日期 | Book 2009Latest edition |
| 关键词 | DES; Discrete Logarithms; Elliptic Curve Cryptography; Factorization; Integer; Number theory; Primality; Pr |
| 版次 | 2 |
| doi | https://doi.org/10.1007/978-0-387-77268-4 |
| isbn_softcover | 978-1-4419-4586-0 |
| isbn_ebook | 978-0-387-77268-4Series ISSN 1568-2633 Series E-ISSN 2512-2193 |
| issn_series | 1568-2633 |
| copyright | Springer-Verlag US 2009 |
发表于 2025-3-21 16:50:39
