- 期刊
A Frobenius Map Approach for an Efficient and Secure Multiplication on Koblitz Curves
並列摘要
The most efficient technique for protecting the using Frobenius algorithms for scalar multiplication on Koblitz curves against the Side Channel Attacks seems to be the multiplier randomization technique proposed by Joye and Tymen. In this paper, an heuristic analysis on the security of the Joye and Tymen's technique is given. A new method improving this technique is proposed. Analysis shows that the proposed method reduce the cost of the Joye and Tymen's technique by about 50%.
延伸閱讀
- 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
- Obukhovskii, V., Zecca, P., & Zvyagin, V. (2002). ON COINCIDENCE INDEX FOR MULTIVALUED PERTURBATIONS OF NONLINEAR FREDHOLM MAPS AND SOME APPLICATIONS. Abstract and Applied Analysis, 2002(), 295-322. https://doi.org/10.1155/S1085337502002853
- Lin, T. C. (2009). Algorithms on Elliptic Curves over Fields of Characteristic Two with Non-Adjacent Forms. International Journal of Network Security, 9(2), 117-120. https://doi.org/10.6633/IJNS.200909.9(2).03
- 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
- 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