Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
Authors:
- 2 August 2001
- book chapter
- Published by Springer Nature
- p. 190-200
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- More Flexible Exponentiation with Precomputation2001
- CM-Curves with Good Cryptographic Properties2001
- Improving the parallelized Pollard lambda search on anomalous binary curvesMathematics of Computation, 1999
- A Survey of Fast Exponentiation MethodsJournal of Algorithms, 1998
- Efficient Elliptic Curve Exponentiation Using Mixed Coordinates1998
- An elliptic curve implementation of the finite field digital signature algorithm1998
- Optimal extension fields for fast arithmetic in public-key algorithms1998
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of CurvesMathematics of Computation, 1994
- Sequences of numbers generated by addition in formal groups and new primality and factorization testsAdvances in Applied Mathematics, 1986
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986