Fast Scalar Multiplication Algorithm Using Constrained Triple-Base Number System and Its Applications
作者： Yunqi Dou , Jiang Weng , Chuangui Ma , Fushan Wei
关键词:
摘要: With the rapid development of embedded devices, wireless sensor network and Internet Things, elliptic curve cryptography as a public key plays an important role to solve security challenges. How improve efficiency scalar multiplication is challenging work for future deployment these new technologies. Because its sparsity, triple-base number system used accelerate in cryptography. Instead using triple base chain, we introduce concept constrained tripe-base system, which sets maximums exponents bases 2, 3 5. On this basis, propose two fast algorithms situations with without precomputations. Our experiments show that are more efficient than 4-NAF, double-base chain approaches. The improvement makes suit network.
sci-hub.se 参考文章(23)
Wei Yu, Kunpeng Wang, Bao Li, Song Tian, Triple-Base Number System for Scalar Multiplication international conference on cryptology in africa. pp. 433- 451 ,(2013) , 10.1007/978-3-642-38553-7_26
Wei Yu, Kunpeng Wang, Bao Li, Song Tian, On the Expansion Length of Triple-Base Number Systems international conference on cryptology in africa. pp. 424- 432 ,(2013) , 10.1007/978-3-642-38553-7_25
Daniel J. Bernstein, Tanja Lange, Inverted Edwards Coordinates Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. pp. 20- 27 ,(2007) , 10.1007/978-3-540-77224-8_4
Vassil Dimitrov, Laurent Imbert, Pradeep Kumar Mishra, Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains Lecture Notes in Computer Science. pp. 59- 78 ,(2005) , 10.1007/11593447_4
Vassil Dimitrov, Todor Cooklev, Two Algorithms for Modular Exponentiation Using Nonstandard Arithmetics IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. ,vol. 78, pp. 82- 87 ,(1995)
Advances in elliptic curve cryptography Cambridge University Press. ,(2005) , 10.1017/CBO9780511546570
Pradeep Kumar Mishra, Vassil Dimitrov, Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation Lecture Notes in Computer Science. pp. 390- 406 ,(2007) , 10.1007/978-3-540-75496-1_26
Nicolas Méloni, M. Anwar Hasan, Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases cryptographic hardware and embedded systems. ,vol. 5747, pp. 304- 316 ,(2009) , 10.1007/978-3-642-04138-9_22
Darrel Hankerson, Alfred J. Menezes, Scott Vanstone, Guide to Elliptic Curve Cryptography ,(2004)
Suman Bala, Gaurav Sharma, Anil K. Verma, Optimized Elliptic Curve Cryptography for wireless sensor networks grid computing. pp. 89- 94 ,(2012) , 10.1109/PDGC.2012.6449797