Better polynomials for GNFS

Article English OPEN
Bai , Shi; Bouvier , Cyril; Kruppa , Alexander; Zimmermann , Paul;
  • Publisher: American Mathematical Society
  • Related identifiers: doi: 10.1090/mcom3048
  • Subject: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] | 11Y05, 11Y16 | [ INFO.INFO-CR ] Computer Science [cs]/Cryptography and Security [cs.CR]

International audience; The general number field sieve (GNFS) is the most efficient algo-rithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the selected polynomials can be modelled in terms o... View more
Share - Bookmark