2 search results - page 1 / 1 » Compression in Finite Fields and Torus-Based Cryptography |
SIAMCOMP
2008
13 years 4 months ago
2008
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
EUROCRYPT
2006
Springer
13 years 8 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...