- 期刊
An Efficient Algorithm for Elliptic Curve Scalar Multiplication Using Extended Double-Base Chain and Point Halving
並列摘要
We propose to represent a scalar in the form of d (1/2)(superscript a)3(superscript b), where a and b are integers and d is an odd integer belonging to a given set. This representation is a combination of the extended double-base number system (DBNS) and the double-base chain representation using powers of 1/2 and 3. Experimental results show that our approach leads to a shorter DBNS expansion and a lower complexity in elliptic curve scalar multiplication, with the cost of only a few pre-computations and storages. This contributes to the efficient implementation of elliptic curve cryptography (ECC).
延伸閱讀
- Liao, C. H. (2007). A New Algorithm for Scalar Point Multiplication in Elliptic Curve Cryptography [master's thesis, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2007.00298
- Liu, S. G., An, S. J., & Du, Y. W. (2021). Efficient and Secure Elliptic Curve Scalar Multiplication Based on Quadruple-and-Add. International Journal of Network Security, 23(5), 750-757. https://doi.org/10.6633/IJNS.202109_23(5).02
- Liu, S. G., Lu, S. M., & Gong, R. W. (2020). Fast Scalar Multiplication Algorithm Based on Co_Z Operations on Elliptic Curves over GF(3^m). International Journal of Network Security, 22(4), 569-574. https://doi.org/10.6633/IJNS.202007_22(4).03
- Basu, S. (2012). A New Parallel Window-Based Implementation of the Elliptic Curve Point Multiplication in Multi-Core Architectures. International Journal of Network Security, 14(2), 101-108. https://doi.org/10.6633/IJNS.201203.14(2).05
- Lee, J. W., Kim, H. Y., Lee, Y. H., Hong, S. M., & Yoon, H. S. (2007). Parallelized Scalar Multiplication on Elliptic Curves Defined over Optimal Extension Field. International Journal of Network Security, 4(1), 99-106. https://doi.org/10.6633/IJNS.200701.4(1).11