Two efficient algorithms for arithmetic of elliptic curves using Frobenius map
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 195-202
- https://doi.org/10.1007/bfb0054025
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Efficient Multiplication on Certain Nonsupersingular Elliptic CurvesPublished by Springer Nature ,2001
- CM-Curves with Good Cryptographic PropertiesPublished by Springer Nature ,2001
- An improved algorithm for arithmetic on a family of elliptic curvesPublished by Springer Nature ,1997
- Efficient algorithms for elliptic curve cryptosystemsPublished by Springer Nature ,1997
- Elliptic Curve Public Key CryptosystemsPublished by Springer Nature ,1993
- Speeding up the computations on an elliptic curve using addition-subtraction chainsRAIRO - Theoretical Informatics and Applications, 1990
- Hyperelliptic cryptosystemsJournal of Cryptology, 1989
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod pMathematics of Computation, 1985