74 search results - page 9 / 15 » High-Performance Architecture of Elliptic Curve Scalar Multi... |
IJNSEC
2011
13 years 2 months ago
2011
In this paper, we present a background on elliptic curve cryptosystems (ECCs) along with the different methods used to compute the scalar multiplication (ECSM), which is the core...
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...
SACRYPT
2005
Springer
14 years 26 days ago
2005
Springer
We present two left-to-right integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a s...
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...
CHES
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. This work proposes a new elliptic curve processor architecture for the computation of point multiplication for curves defined over fields GF(p). This is a scalable arch...