Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm
Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm
B. Murphy
1999 · DOI: 10.25911/5D6272199E44D
74 Citations
TLDR
The number field sieve, the newest and fastest known method for factorising integers used in public-key cryptosystems, is considered, and so-called polynomial selection methods for the numberField sieve are improved.