• Publications
  • Influence
A public key cryptosystem and a signature scheme based on discrete logarithms
TLDR
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields. Expand
A subexponential-time algorithm for computing discrete logarithms over GF(p2)
TLDR
An algorithm for computing discrete logarithms over GF(p*), where p is a prime, in subexponential time is described, which uses quadratic fields as the appropriate algebraic structure. Expand
On Computing Logarithms Over Finite Fields
The problem of computing logarithms over finite fields has proved to be of interest in different fields [4]. Subexponential time algorithms for computing logarithms over the special cases GF(p),Expand