New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
Authors:
- 26 February 2008
- book chapter
- Published by Springer Nature
- p. 229-247
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography2007
- Trading Inversions for Multiplications in Elliptic Curve CryptographyDesigns, Codes and Cryptography, 2006
- Efficient Scalar Multiplication by Isogeny Decompositions2006
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains2005
- The Jacobi Model of an Elliptic Curve and Side-Channel Analysis2003
- Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation2003
- Software Implementation of the NIST Elliptic Curves Over Prime Fields2001
- Fast Implementation of Elliptic Curve Arithmetic in GF(p n )2000
- Fast Implementation of Public-Key Cryptography on a DSP TMS320C62011999
- Efficient Elliptic Curve Exponentiation Using Mixed Coordinates1998