526 search results - page 1 / 106 » On the Number of Minimal Addition Chains |
CSC
2006
13 years 6 months ago
2006
An addition chain for a natural number n is a sequence 1 = a0 < a1 < . . . < ar = n of numbers such that for each 0 < i r, ai = aj + ak for some 0 k j < i. Thurbe...
IJNSEC
2006
13 years 5 months ago
2006
Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplica...
WAIFI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper we propose a new approach to point scalar multiplication on elliptic curves defined over fields of characteristic greater than 3. It is based on new point...
TEC
2008
13 years 5 months ago
2008
This paper deals with the optimal computation of finite field exponentiation, which is a well-studied problem with many important applications in the areas of error-correcting code...
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. The Joint Sparse Form is currently the standard representation system to perform multi-scalar multiplications of the form [n]P + m[Q]. We introduce the concept of Joint D...