58 search results - page 1 / 12 » An Analysis of Double Base Number Systems and a Sublinear Sc... |
MYCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
TC
2011
12 years 11 months ago
2011
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...
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...
INDOCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
This paper analyzes the best speeds that can be obtained for single-scalar multiplication with variable base point by combining a huge range of options: – many choices of coordin...
JCP
2007
13 years 4 months ago
2007
Abstract— Side channel attacks such as Simple Power Analysis(SPA) attacks provide a new challenge for securing algorithms from an attacker. Algorithms for elliptic curve point sc...