A Novel Pre-Computation Scheme of Window τNAF for Koblitz Curves
暂无分享,去创建一个
Bao Li | Wei Yu | Saud Al Musa | Guangwu Xu
[1] Neal Koblitz,et al. CM-Curves with Good Cryptographic Properties , 1991, CRYPTO.
[2] Alfred Menezes,et al. Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.
[3] Christophe Doche,et al. Double-Base Number System for Multi-Scalar Multiplications , 2009, IACR Cryptol. ePrint Arch..
[4] N. Koblitz. p-adic Numbers, p-adic Analysis, and Zeta-Functions , 1977 .
[5] Jerome A. Solinas,et al. Efficient Arithmetic on Koblitz Curves , 2000, Des. Codes Cryptogr..
[6] V. Murty,et al. NONADJACENT RADIX-τ EXPANSIONS OF INTEGERS IN EUCLIDEAN IMAGINARY QUADRATIC NUMBER FIELDS , 2005 .
[7] Guangwu Xu,et al. On the Optimal Pre-Computation of Window τ NAF for Koblitz Curves , 2016, IEEE Trans. Computers.
[8] Ian F. Blake,et al. A note on window tau-NAF algorithm , 2005, Inf. Process. Lett..
[9] Patrick Longa,et al. Novel Precomputation Schemes for Elliptic Curve Cryptosystems , 2009, ACNS.
[10] Ricardo Dahab,et al. Improved Algorithms for Elliptic Curve Arithmetic in GF(2n) , 1998, Selected Areas in Cryptography.
[11] Francisco Rodríguez-Henríquez,et al. Two is the fastest prime: lambda coordinates for binary elliptic curves , 2014, Journal of Cryptographic Engineering.
[12] Roberto Maria Avanzi,et al. Extending Scalar Multiplication Using Double Bases , 2006, ASIACRYPT.