ROOT OPTIMIZATION OF POLYNOMIALS IN THE NUMBER FIELD SIEVE

被引：6

作者：

Bai, Shi ^{[1
]}

Brent, Richard P. ^{[2
]}

Thome, Emmanuel ^{[3
]}

机构：

[1] Univ Auckland, Dept Math, Auckland, New Zealand

[2] Australian Natl Univ, Inst Math Sci, Canberra, ACT 0200, Australia

[3] INRIA Nancy, Villers Les Nancy, France

来源：

MATHEMATICS OF COMPUTATION | 2015年 / 84卷 / 295期

关键词：

D O I：

10.1090/S0025-5718-2015-02926-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be modelled in terms of size and root properties. In this paper, we describe some algorithms for selecting polynomials with very good root properties.

引用

页码：2447 / 2457

页数：11

共 50 条

[41] DISCRETE LOGARITHMS IN GF(P) USING THE NUMBER-FIELD SIEVE
GORDON, DM
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1993, 6 (01) : 124 - 138
[42] A pentagonal number sieve
Corteel, S
Savage, CD
Wilf, HS
Zeilberger, D
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1998, 82 (02) : 186 - 192
[43] Analysis and Improvements to the Special Number Field Sieve for Discrete Logarithm Problems
Liu, Liwei
Xu, Maozhi
Zhou, Guoqing
2021 IEEE 5TH INTERNATIONAL CONFERENCE ON CRYPTOGRAPHY, SECURITY AND PRIVACY (ICCSP), 2021, : 45 - 49
[44] Collecting relations for the number field sieve in GF(p6)
Gaudry, Pierrick
Gremy, Laurent
Videau, Marion
LMS JOURNAL OF COMPUTATION AND MATHEMATICS, 2016, 19 : 332 - 350
[45] Space Complexity Analysis of Sieving in the Number Field Sieve Integer Factorization
Wang, Qi
Zang, Hongyan
Fan, Xiubin
Wang, Yu
PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON MECHATRONICS, MATERIALS, CHEMISTRY AND COMPUTER ENGINEERING 2015 (ICMMCCE 2015), 2015, 39 : 335 - 340
[46] The Number of Irreducible Polynomials over a Finite Field : An Algebraic Proof
Aditya, Ricky
INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2015, 53 (04): : 110 - 115
[47] The number of permutation polynomials of a given degree over a finite field
Das, P
FINITE FIELDS AND THEIR APPLICATIONS, 2002, 8 (04) : 478 - 490
[48] A characterization of the number of roots of linearized and projective polynomials in the field of coefficients
McGuire, Gary
Sheekey, John
FINITE FIELDS AND THEIR APPLICATIONS, 2019, 57 : 68 - 91
[49] CAIRN 2: An FPGA implementation of the sieving step in the number field sieve method
Izu, Tetsuya
Kogure, Jun
Shimoyama, Takeshi
CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2007, PROCEEDINGS, 2007, 4727 : 364 - +
[50] Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
Kim, Taechan
Barbulescu, Razvan
ADVANCES IN CRYPTOLOGY - CRYPTO 2016, PT I, 2016, 9814 : 543 - 571

← 1 2 3 4 5 →