In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...
Ryuichi Harasawa, Junji Shikata, Joe Suzuki, Hidek...
Abstract. Systems for the support of customer relationship management are becoming increasingly attractive for vendors. Loyalty systems provide an interesting possibility for vendo...
Matthias Enzmann, Marc Fischlin, Markus Schneider ...
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this c...
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 ...