A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm Problem
| Autor: | Ayan Mahalanobis, Ansari Abdullah, Vivek Mohan Mallick |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Discrete mathematics
010102 general mathematics Hessian form of an elliptic curve 0102 computer and information sciences 01 natural sciences Schoof–Elkies–Atkin algorithm Elliptic curve point multiplication Elliptic curve 010201 computation theory & mathematics Las Vegas algorithm Hyperelliptic curve cryptography Hardware_ARITHMETICANDLOGICSTRUCTURES 0101 mathematics Schoof's algorithm Tripling-oriented Doche–Icart–Kohel curve Mathematics |
| Zdroj: | Progress in Cryptology – INDOCRYPT 2018 ISBN: 9783030053772 INDOCRYPT |
| DOI: | 10.1007/978-3-030-05378-9_12 |
| Popis: | In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points on an elliptic curve and is thus not a generic algorithm. The algorithm that we describe has some similarities with the most powerful index-calculus algorithm for the discrete logarithm problem over a finite field. The algorithm has no restriction on the finite field over which the elliptic curve is defined. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|