Analysis of Fractional ωmbNAF for Scalar Multiplication

In the current work we analyze the average Hamming weight of recoded sequence obtained by fractional ωmbNAF algorithm using Markov theory. Cost comparison between fractional ωmbNAF and different scalar recoding methods is given. Regardless of memory restraint, it is shown that \(\{2,3,5\}\mbox{NAF}_{3+\frac{3}{4}}\) improves tree-based double base chain by a factor of 6.8% and 13.2% is Jacobian curves(with efficiency-orient selected parameter a = 3) and inverted Edwards curves respectively.

[1]  Tsuyoshi Takagi,et al.  Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems , 2006, IEEE Transactions on Computers.

[2]  Patrick Longa,et al.  Accelerating the Scalar Multiplication on Elliptic Curve Cryptosystems over Prime Fields , 2008, IACR Cryptol. ePrint Arch..

[3]  Ming Li,et al.  Analysis of the Hamming Weight of the Extended wmbNAF , 2011, IACR Cryptol. ePrint Arch..

[4]  Yukio Tsuruoka,et al.  Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method , 1992, CRYPTO.

[5]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[6]  Laurent Imbert,et al.  The double-base number system and its application to elliptic curve cryptography , 2007, Math. Comput..

[7]  Christophe Doche,et al.  A Tree-Based Approach for Computing Double-Base Chains , 2008, ACISP.

[8]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[9]  Laurent Imbert,et al.  Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains , 2005, ASIACRYPT.

[10]  Tanja Lange,et al.  Handbook of Elliptic and Hyperelliptic Curve Cryptography , 2005 .

[11]  Laurent Imbert,et al.  Extended Double-Base Number System with Applications to Elliptic Curve Cryptography , 2006, INDOCRYPT.

[12]  Patrick Longa,et al.  Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication , 2009, IACR Cryptol. ePrint Arch..

[13]  Bodo Möller,et al.  Improved Techniques for Fast Exponentiation , 2002, ICISC.

[14]  晋輝 趙,et al.  H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen and F. Vercauteren (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography, Discrete Math. Appl. (Boca Raton)., Chapman & Hall/CRC, 2006年，xxxiv + 808ページ． , 2009 .

[15]  Bao Li,et al.  Triple-Base Number System for Scalar Multiplication , 2013, AFRICACRYPT.