- 期刊
A Fast Scalar Multiplication Algorithm Based on Alternate-Zeckendorf Representation
摘要
This paper proposed a new method to point scalar multiplication on elliptic curve and it is defined in a finite field with a characteristic greater than 3. It is based on the Transformed Fibonacci type sequence like (2P + Q) and it can resist the Simple Power Attack (SPA). Although the sequence quite easier to calculate, expressing any k using the sequence remains a very difficult problem, so we proposed the Alternate-Zeckendorf representation and given the proof of this view. The New ADD algorithm is also added to the new algorithm and in meanwhile we also listed (2P + Q) results as a table to reduce the computation cost. The performance comparisons show that our algorithm is less costly than other algorithms 12.7% to 27.9% at least.
延伸閱讀
- Liu, S. G., & Hu, Y. P. (2009). A Fast and Secure Elliptic Curve Scalar Multiplication Algorithm over GF (P(superscript m)). 工業工程學刊, 26(4), 255-265. https://doi.org/10.29977/JCIIE.200907.0003
- 黃于容（2003）。A Multilevel Routing Algorithm for Crosstalk minimization〔碩士論文，中原大學〕。華藝線上圖書館。https://doi.org/10.6840/cycu200300660
- 段榮保（2006）。A Multilevel Routing Algorithm for Crosstalk minimization〔碩士論文，中原大學〕。華藝線上圖書館。https://doi.org/10.6840/cycu200600057
- 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
- Jui, P. C. (2015). Efficient Algorithms for Constant Multiplications and Their Hardware Implementation [doctoral dissertation, National Central University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0031-0412201512043075