Results 111 to 120 of about 6,909,811 (176)

Solving elliptic curve discrete logarithm problems using Weil descent

open access: yes, 2001
We provide the first cryptographically interesting instance of the elliptic curve discrete logarithm problem which resists all previously known attacks, but which can be solved with modest computer resources using the Weil descent attack methodology of ...
Andreas Stein   +2 more
core  

A Fast Java Implementation of a Provably Secure Pseudo Random Bit Generator Based on the Elliptic Curve Discrete Logarithm Problem

open access: yes, 2008
We present a pseudo random bit generator whose security is based on the intractability of the discrete logarithm problem in the group E(#p ) of rational points on an elliptic curve over a finite prime field #p .
Harald Baier
core  

Home - About - Disclaimer - Privacy