47 search results - page 3 / 10 » The 1.5D sieve algorithm |
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
STOC
2001
ACM
14 years 6 months ago
2001
ACM
PRL
2008
13 years 5 months ago
2008
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
ANTS
2004
Springer
13 years 11 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...