Name
Abstract | ||
|---|---|---|
At present, the joint sparse form and the joint binary-ternary method are the most efficient representation systems for calculating multi-scalar multiplications [k]P + [l]Q, where k,l are scalars and P,Q are points on the same elliptic curve. We introduce the concept of a joint triple-base chain. Our algorithm, named the joint binary-ternary-quintuple method, is able to find a shorter joint triple-base chain for the sparseness of triple-base number systems. With respect to the joint sparse form, this algorithm saves 32% of the additions, saving 13% even compared with the joint binary-ternary method. The joint binary-ternary-quintuple method is the fastest method among the existing algorithms, which speeds up the signature verification of the elliptic curve digital signature algorithm. It is very suitable for software implementation. © 2013 Springer-Verlag. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-38033-4_12 | ISPEC |
Keywords | Field | DocType |
elliptic curve cryptography,hamming weight,joint triple-base chain,multi-scalar multiplication | Elliptic Curve Digital Signature Algorithm,Discrete mathematics,Monad (category theory),Scalar multiplication,Scalar (mathematics),Base Number,Hamming weight,Elliptic curve cryptography,Mathematics,Elliptic curve | Conference |
Volume | Issue | ISSN |
7863 LNCS | null | 16113349 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Yu | 1 | 125 | 19.50 |
| Kunpeng Wang | 2 | 41 | 11.79 |
| Bao Li | 3 | 185 | 38.33 |
| Song Tian | 4 | 10 | 2.59 |