NFS with four large primes: an explosive experiment

DOI10.1007/3-540-44750-4_30MaRDI QIDQ4343449zbMATH OpenFDO

Authors Bruce A. Dodson, Arjen K. Lenstra

Publication date 14 August 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44750-4_30

zbMATH Keywords

integer factoring algorithmmulti-large primesnumber field sieve

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 503281
• A primality test for \(4Kp^n-1\) numbers
• On the large sieve with primes
• ON THE DISTRIBUTION OF PRIMES (mod4)
• Four primality testing algorithms
• New Primes of the Form n 4 + 1
• On generalized 4-primes numbers
• Experimental results on probable primality
• scientific article; zbMATH DE number 2081060
• Sequential Experiments with Primes

Cited in

(8)

• Parameter trade-offs for NFS and ECM
• Running Time Predictions for Factoring Algorithms
• scientific article; zbMATH DE number 177024 (Why is no real title available?)
• Factoring with Two Large Primes
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Predicting the Sieving Effort for the Number Field Sieve
• On the number of semismooth integers
• One approach to factorization of positive integers

This page was built for publication: NFS with four large primes: an explosive experiment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4343449)