- 期刊
An Improved Ternary Montgomery Ladder Algorithm on Elliptic Curves over GF(3^m)
摘要
In this paper, we propose a new scalar multiplication algorithm on elliptic curves over GF(3^m). It combines original Montgomery ladder algorithm and the ternary representation of the scalar, which makes full use of cubing. In addition, in order to improve performance, we have presented new composite operation formulas which are 2P_1+P_2 and 3P_1, and applied them to the improved scalar multiplication algorithm. Based on the original Montgomery ladder algorithm, it can resist Simple Power Attack (SPA). In the experimental analysis, we set the ratio of inversion and multiplication to a dynamic value. Results show that with respect to previous algorithm, the average efficiency of proposed scalar multiplication algorithm is increased by 7.8 % to 11.3 % in affine coordinate, and 4.0 % to 17.9 % in projective coordinate.
延伸閱讀
- Shieh, M. D., Chen, J. H., Lin, W. C., & Wu, C. M. (2009). An Efficient Multiplier/Divider Design for Elliptic Curve Cryptosystem over GF(2(superscript m)). Journal of Information Science and Engineering, 25(5), 1555-1573. https://doi.org/10.6688/JISE.2009.25.5.15
- Tsai, P. C. (2009). Generating Elliptic Curves with Prime Order by Complex Multiplication [master's thesis, National Chiao Tung University]. Airiti Library. https://doi.org/10.6842/NCTU.2009.01169
- Liu, S. G., & Lu, R. (2022). Montgomery Algorithm Based on Co_Z Operation on Edwards Curves over Prime Field. International Journal of Network Security, 24(2), 333-341. https://doi.org/10.6633/IJNS.202203_24(2).16
- Chen, C. (2011). Height functions on elliptic curves over function fields [master's thesis, The University of Hong Kong]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0029-1812201200019458
- King, B. (2009). Mapping an Arbitrary Message to an Elliptic Curve when Defined over GF(2(superscript n)). International Journal of Network Security, 8(2), 169-176. https://doi.org/10.6633/IJNS.200903.8(2).10