47 search results - page 5 / 10 » Solving a 676-Bit Discrete Logarithm Problem in GF(36n) |
104
Voted
ASIACRYPT
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Frey and R¨uck gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite ...
120
click to vote
ANTS
2006
Springer
15 years 3 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
103
click to vote
AAECC
2006
Springer
14 years 11 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
ALGORITHMICA
2006
14 years 11 months ago
2006
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
INFORMATICALT
2007
14 years 11 months ago
2007
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...