Optimal Parameterization of SNFS
The Special Number Field Sieve factoring algorithm has a large number of parametric choices, each of which can affect its run time. We give guidelines for these choices along with a discussion of useful coding optimizations. We also give a theoretical argument which proves that the choice of sieving...
Main Author: | Silverman Robert D. |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2007-04-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/JMC.2007.007 |
Similar Items
-
Η μέθοδος παραγοντοποίησης ακεραίων αριθμών number field sieve : θεωρία και υλοποίηση
by: Καραπάνος, Νικόλαος
Published: (2010) -
An Introduction to the General Number Field Sieve
by: Briggs, Matthew Edward
Published: (2014) -
Υλοποίηση της μεθόδου παραγοντοποίησης ακεραίων αριθμών number field sieve σε παράλληλο υπολογιστικό περιβάλλον
by: Μπακογιάννης, Χρήστος
Published: (2010) -
On Sufficient Conditions for the Existence of Twin Values in Sieves over the Natural Numbers
by: Szramowski, Luke
Published: (2020) -
Lattice Sieving in Three Dimensions for Discrete Log in Medium Characteristic
by: McGuire Gary, et al.
Published: (2020-11-01)