Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

ACNS
2009
Springer

favoriteEmaildiscussreport

124views Cryptology» more ACNS 2009»

Novel Precomputation Schemes for Elliptic Curve Cryptosystems

14 years 5 months ago

Novel Precomputation Schemes for Elliptic Curve Cryptosystems

Download www.cacr.math.uwaterloo.ca

We present an innovative technique to add elliptic curve points with the form P Q± , and discuss its application to the generation of precomputed tables for the scalar multiplication. Our analysis shows that the proposed schemes offer, to the best of our knowledge, the lowest costs for precomputing points on both single and multiple scalar multiplication and for various elliptic curve forms, including the highly efficient Jacobi quartics and Edwards curves.

Patrick Longa, Catherine H. Gebotys

Real-time Traffic

ACNS 2009 | Cryptography | Elliptic Curve | Elliptic Curve Points | Scalar Multiplication |

claim paper

Related Content

» An efficient undeniable grouporiented signature scheme

» An Elliptic Curve Cryptosystem Design Based on FPGA Pipeline Folding

» Efficient Countermeasures against RPA DPA and SPA

» A Provably Secure Elliptic Curve Scheme with Fast Encryption

» Message Recovery Signature Scheme Using Complementary Elliptic Curves

» Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field

» Cryptosystems Based on Elliptic Curve Pairing

» An MSS Based on the Elliptic Curve Cryptosystem

» Trapdooring Discrete Logarithms on Elliptic Curves over Rings

Post Info
More Details (n/a)

Added	25 May 2010
Updated	25 May 2010
Type	Conference
Year	2009
Where	ACNS
Authors	Patrick Longa, Catherine H. Gebotys

Comments (0)