Fast Implementation of Elliptic Curve Arithmetic in GF(p n )
Authors:
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 405-421
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method2001
- CM-Curves with Good Cryptographic Properties2001
- Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic1999
- ECC/DLP and Factoring-Based Cryptography: A Tale of Two Families (Invited Lecture)Lecture Notes in Computer Science, 1998
- Two efficient algorithms for arithmetic of elliptic curves using Frobenius map1998
- Optimal extension fields for fast arithmetic in public-key algorithms1998
- Efficient algorithms for elliptic curve cryptosystems1997
- Efficient elliptic curve exponentiation1997
- An implementation of elliptic curve cryptosystems over F/sub 2/155IEEE Journal on Selected Areas in Communications, 1993
- Elliptic curve cryptosystemsMathematics of Computation, 1987