65 search results - page 8 / 13 » Trading Inversions for Multiplications in Elliptic Curve Cry... |
CTRSA
2005
Springer
14 years 1 months ago
2005
Springer
For an integer w ≥ 2, a radix 2 representation is called a width-w nonadjacent form (w-NAF, for short) if each nonzero digit is an odd integer with absolute value less than 2w−...
AAECC
2006
Springer
13 years 7 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
IACR
2011
12 years 7 months ago
2011
: Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher th...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
ARITH
2007
IEEE
14 years 1 months ago
2007
IEEE
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...