| 引用本文: | 倪谷炎.用数域筛法分解大整数.[J].国防科技大学学报,1998,20(4):103-108.[点击复制] |
| Ni Guyan.Factoring Large Integers with the Number Field Sieve[J].Journal of National University of Defense Technology,1998,20(4):103-108[点击复制] |
|
| |
|
|
| 本文已被：浏览 7069次 下载 9355次 |
| 用数域筛法分解大整数 |
| 倪谷炎 |
|
(国防科技大学 系统工程与数学系 湖南 长沙 410073)
|
| 摘要: |
| 随着Fermat数F7和F9被分解, 一个新的算法被提了出来, 那就是J. Pollard 提出的“数域筛法”(NFS). A. K. Lenstra等人对数域筛法进行了深入的研究, 已经使数域筛法从原来对一些特殊整数的分解发展到对一般整数的分解。本文试图对数域筛法理论及其运行作简要的论述。 |
| 关键词: 整数分解, 算法, 代数数域 |
| DOI： |
| 投稿日期：1997-12-05 |
| 基金项目:国防预研项目资助 |
|
| Factoring Large Integers with the Number Field Sieve |
| Ni Guyan |
|
(Department of Systems Engineering and Mathematics, NUDT, Changsha, 410073)
|
| Abstract: |
| With the Fermat numbers F7 and F9 being factored into primes, a new algorithm, the number field sieve, is given, which was proposed by Pollard. Manasse and Pollard investigate this algorithm thoroughly, and develop it from the special number field sieve (SNFS) to the general number field sieve (GNFS). In this paper, we describe the new algorithm and explain the NFS implementation. |
| Keywords: factoring integers, algorithm, algebraic number field |
|
|
|
|
|
