| 用数域筛法分解大整数 |
| |
| 引用本文： | 倪谷炎.用数域筛法分解大整数[J].国防科技大学学报,1998,20(4):103-108. |
| |
| 作者姓名： | 倪谷炎 |
| |
| 作者单位： | 国防科技大学系统工程与数学系 |
| |
| 摘 要： | 随着Ｆｅｒｍａｔ数Ｆ７和Ｆ９被分解，一个新的算法被提了出来，那就是Ｊ．Ｐｏｌａｒｄ提出的“数域筛法”（ＮＦＳ）．Ａ．Ｋ．Ｌｅｎｓｔｒａ等人对数域筛法进行了深入的研究，已经使数域筛法从原来对一些特殊整数的分解发展到对一般整数的分解。本文试图对数域筛法理论及其运行作简要的论述。
|
| 关 键 词： | 整数分解，算法，代数数域 |
| 收稿时间： | 1997/12/5 0:00:00 |
Factoring Large Integers with the Number Field Sieve |
| |
| Ni Guyan.Factoring Large Integers with the Number Field Sieve[J].Journal of National University of Defense Technology,1998,20(4):103-108. |
| |
| Authors: | Ni Guyan |
| |
| Institution: | 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 |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
