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.
€44.44
购买此电子书可免费获赠一本！
语言 英语 ● 格式 PDF ● ISBN 9783540478928 ● 编辑 Arjen K. Lenstra & Hendrik W.Jr. Lenstra ● 出版者 Springer Berlin Heidelberg ● 发布时间 2006 ● 下载 3 时 ● 货币 EUR ● ID 6319237 ● 复制保护 Adobe DRM
需要具备DRM功能的电子书阅读器
来自同一作者的更多电子书 / 编辑
48,216 此类电子书
