14 search results - page 1 / 3 » The Function Field Sieve in the Medium Prime Case |
EUROCRYPT
2006
Springer
14 years 2 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...
CRYPTO
2006
Springer
14 years 2 months ago
2006
Springer
PKC
2010
Springer
14 years 28 days ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
MOC
2010
13 years 5 months ago
2010
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
ANTS
2004
Springer
14 years 4 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...