MOC

2010

13 years 4 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...

JOC

2011

13 years 4 months ago
2011

We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The ﬁn...

PKC

2010

Springer

13 years 7 months ago
2010

Springer

The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...

MOC

2002

13 years 9 months ago
2002

Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over finite fields. Some of them hav...

MOC

2002

13 years 9 months ago
2002

We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...

AAECC

2005

Springer

13 years 9 months ago
2005

Springer

The ideal class group of hyperelliptic curves can be used in cryptosystems based on the discrete logarithm problem. In this article we present explicit formulae to perform the gro...

CORR

2006

Springer

13 years 9 months ago
2006

Springer

The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...

AAECC

2006

Springer

13 years 9 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...

PKC

2010

Springer

13 years 11 months 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...

PKC

2000

Springer

14 years 29 days ago
2000

Springer

A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...