- 期刊
Speeding Scalar Multiplication of Elliptic Curve over GF (2(superscript mn))
並列摘要
Lee et al. proposed two methods to speed up the computation of scalar multiplication of elliptic curve defined over GF (2(superscript mn)) with a medium size of m in the range 10≤m≤20. In these methods, Frobenius map is utilized to expand the integer k and each coefficient of the expansion is represented as a binary string. In this pa- per, with the application of joint sparse form (JSF) to the coefficients, some variations of Lee et al.'s methods are proposed to achieve a better performance at a lower storage requirement.
延伸閱讀
- Chiou, C. W., & Lin, L. C. (2004). Fast Array Multiplications over GF(2(superscript m)) Fields with Multiple Speeds. 淡江理工學刊, 7(3), 139-144. https://doi.org/10.6180/jase.2004.7.3.03
- Liu, S. G., Heng, X., & Li, Y. M. (2020). Anti-SPA Scalar Multiplication Algorithm on Twisted Edwards Elliptic Curve. International Journal of Network Security, 22(6), 1015-1021. https://doi.org/10.6633/IJNS.202011_22(6).16
- 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
- Moon, S. (2006). A Binary Redundant Scalar Point Multiplication in Secure Elliptic Curve Cryptosystems. International Journal of Network Security, 3(2), 132-137. https://doi.org/10.6633/IJNS.200609.3(2).04
- 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