Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
- 15 April 1999
- book chapter
- Published by Springer Nature
- p. 176-189
- https://doi.org/10.1007/3-540-48910-x_13
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Fast Exponentiation with PrecomputationPublished by Springer Nature ,2001
- CM-Curves with Good Cryptographic PropertiesPublished by Springer Nature ,2001
- Fast Multiplication on Elliptic Curves over Small Fields of Characteristic TwoJournal of Cryptology, 1998
- Efficient Elliptic Curve Exponentiation Using Mixed CoordinatesPublished by Springer Nature ,1998
- Two efficient algorithms for arithmetic of elliptic curves using Frobenius mapPublished by Springer Nature ,1998
- An elliptic curve implementation of the finite field digital signature algorithmPublished by Springer Nature ,1998
- Optimal extension fields for fast arithmetic in public-key algorithmsPublished by Springer Nature ,1998
- An improved algorithm for arithmetic on a family of elliptic curvesPublished by Springer Nature ,1997
- Optimal normal bases in GF(pn)Discrete Applied Mathematics, 1989
- The Arithmetic of Elliptic CurvesPublished by Springer Nature ,1986