47 search results - page 4 / 10 » The 1.5D sieve algorithm |
ASIACRYPT
2003
Springer
14 years 3 months ago
2003
Springer
We estimate the yield of the number field sieve factoring algorithm when applied to the 1024-bit composite integer RSA-1024 and the parameters as proposed in the draft version [17...
ANTS
2010
Springer
14 years 1 months ago
2010
Springer
: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the d...
MOC
2000
13 years 9 months ago
2000
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
ITCC
2005
IEEE
14 years 3 months ago
2005
IEEE
Recently, efficient custom-hardware designs were proposed for the linear algebra step of the Number Field Sieve integer factoring algorithm. These designs make use of a heuristic ...
MCAM
2007
Springer
14 years 3 months ago
2007
Springer
Existing Web image search engines index images by textual descriptions including filename, image caption, surrounding text, etc. However, the textual description available on the W...