| 书目名称 | The Development of the Number Field Sieve |
| 编辑 | Arjen K. Lenstra,Hendrik W. Lenstra |
| 视频video | |
| 丛书名称 | Lecture Notes in Mathematics |
| 图书封面 |  |
| 描述 | The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollard‘s original manuscript is included. In addition, there is an annotated bibliography of directly related literature. |
| 出版日期 | Conference proceedings 1993 |
| 关键词 | Algebra; Algebraic Number Fields; Computational Number Theory; Factoring algorithm; Prime; Prime Numbers; |
| 版次 | 1 |
| doi | https://doi.org/10.1007/BFb0091534 |
| isbn_softcover | 978-3-540-57013-4 |
| isbn_ebook | 978-3-540-47892-8Series ISSN 0075-8434 Series E-ISSN 1617-9692 |
| issn_series | 0075-8434 |
| copyright | Springer-Verlag Berlin Heidelberg 1993 |
发表于 2025-3-21 18:57:06
