Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 316-327
- https://doi.org/10.1007/3-540-48059-5_27
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Use of Elliptic Curves in CryptographyPublished by Springer Nature ,2000
- Fast Multiplication on Elliptic Curves over Small Fields of Characteristic TwoJournal of Cryptology, 1998
- A Survey of Fast Exponentiation MethodsJournal of Algorithms, 1998
- 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
- Fast Key Exchange with Elliptic Curve SystemsPublished by Springer Nature ,1995
- Elliptic curve cryptosystems and their implementationJournal of Cryptology, 1993
- An implementation of elliptic curve cryptosystems over F/sub 2/155IEEE Journal on Selected Areas in Communications, 1993
- Speeding the Pollard and elliptic curve methods of factorizationMathematics of Computation, 1987
- Elliptic curve cryptosystemsMathematics of Computation, 1987