- 期刊
Algorithms on Elliptic Curves over Fields of Characteristic Two with Non-Adjacent Forms
並列摘要
Let IF(subscript q) be a finite field of characteristic two and let ø be the Frobenius endomorphism of an elliptic curve. To find or improve efficient algorithms for scalar multiplication sP of point P in the elliptic curve cryptography, it is always an important subject. If IF(subscript q) = IF2, Solinas [5] has developed an algorithm for computing the ø-NAF. In this note, we extend Solinas' ø-NAF algorithm to IF(subscript q), where q is a power of two, and give another efficient algorithms for ø-NAF, thereby show that the length of ø-NAF is at most two bits longer than the length of ø-expansion.
延伸閱讀
- Li, Z. Y. (2006). Computations on the Deuring Correspondence of Supersingular Elliptic Curves [master's thesis, National Taiwan Normal University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0021-0712200716100054
- Laio, H. M. (2003). Integral Points on Elliptic Curves [master's thesis, National Taiwan Normal University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0021-2603200719135596
- Su, B. Y. (2010). The Prime Order of Rational Points on Elliptic Curves [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2010.03195
- Liao, H. M. (2009). Quadratic Twists of Elliptic Curves [doctoral dissertation, National Taiwan Normal University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0021-1610201315151152
- Hakuta, K. (2015). Metrics on the Sets of Nonsupersingular Elliptic Curves in Simplified Weierstrass Form over Finite Fields of Characteristic Two. International Journal of Mathematics and Mathematical Sciences, 2015(), 200-204. https://doi.org/10.1155/2015/597849