1296 search results - page 5 / 260 » The Number Field Sieve |
ANTS
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
183
Voted
POPL
2007
ACM
16 years 1 days ago
2007
ACM
The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a s...
ASIACRYPT
2003
Springer
15 years 5 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...
JOC
2011
14 years 6 months ago
2011
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The fin...
129
click to vote
ISPDC
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...