Work

Size Optimization of Sextic Polynomials in the Number Field Sieve

Year: 2012

Type: article

Abstract: . 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. We describe some methods to optimize the size property of sextic polynomials.

Authors: Shi Bai, Paul Zimmermann

Institution: Australian National University

Language: English

Topic: Cryptography and Residue Arithmetic

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2741703928

FWCI:

Cites: 10

Cited by:

Related to: 10