TY - GEN
T1 - Fastest multi-scalar multiplication based on optimal double-base chains
AU - Suppakitpaisarn, Vorapong
AU - Imai, Hiroshi
AU - Masato, Edahiro
PY - 2012
Y1 - 2012
N2 - We propose an algorithm to produce the optimal double-base chains (DBC) that minimize the time used for computing a multi-scalar multiplication, one of bottleneck operations of elliptic curve cryptosystem. The double-base chains are representations that combine binary and ternary representations. Since there are many possible sequences for a specific multi-scalar multiplication, we need to find an optimal sequence with smallest weighted sum of costs for elementary operations. Our algorithm is the first to attain the the fastest sequence with the same time complexity, O(lg 2 r), as existing greedy-type algorithms, by means of dynamic programming. Also, experimental results show that our algorithm reduces the time for computing multi-scalar multiplications by 3.2-11.3% in less than a second for 192 to 448 bit inputs with Java implementation on a personal computer.
AB - We propose an algorithm to produce the optimal double-base chains (DBC) that minimize the time used for computing a multi-scalar multiplication, one of bottleneck operations of elliptic curve cryptosystem. The double-base chains are representations that combine binary and ternary representations. Since there are many possible sequences for a specific multi-scalar multiplication, we need to find an optimal sequence with smallest weighted sum of costs for elementary operations. Our algorithm is the first to attain the the fastest sequence with the same time complexity, O(lg 2 r), as existing greedy-type algorithms, by means of dynamic programming. Also, experimental results show that our algorithm reduces the time for computing multi-scalar multiplications by 3.2-11.3% in less than a second for 192 to 448 bit inputs with Java implementation on a personal computer.
KW - Cryptography
KW - Double-Base Chains
KW - Internet Security
KW - Multi-Scalar Multiplication
KW - Optimal Expansion
UR - http://www.scopus.com/inward/record.url?scp=84867188361&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867188361&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84867188361
SN - 9781908320049
T3 - World Congress on Internet Security, WorldCIS-2012
SP - 93
EP - 98
BT - World Congress on Internet Security, WorldCIS-2012
T2 - World Congress on Internet Security, WorldCIS-2012
Y2 - 10 June 2012 through 12 June 2012
ER -