Comparing the MOV and FR Reductions in Elliptic Curve Cryptography
- 15 April 1999
- book chapter
- Published by Springer Nature
- p. 190-205
- https://doi.org/10.1007/3-540-48910-x_14
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone AlgorithmJournal of Cryptology, 1998
- Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝Mathematics of Computation, 1998
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of CurvesMathematics of Computation, 1994
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993
- Elliptic Curves and Primality ProvingMathematics of Computation, 1993
- Nonsingular plane cubic curves over finite fieldsJournal of Combinatorial Theory, Series A, 1987
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- Elliptic Curve CryptosystemsMathematics of Computation, 1987
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod pMathematics of Computation, 1985
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978