Elliptic Curve Scalar Multiplication with x-Coordinate[J]. ZHANG Ning1, PEI Qingqi2, XIAO Guozhen1 1. State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, Shaanxi , China; 2. Ministry of Education Key Laboratory of Computer Networks and Information Security ,...
In this work, we propose an algorithm to produce the double-base chain that optimizes the time used for computing an elliptic curve scalar multiplication, i.e. the bottleneck operation of the elliptic curve cryptosystem. The double-base number system and its subclass, double-base chain, are ...
2) elliptic curve scalar multiplication algorithm 椭圆曲线数乘算法3) Elliptic curve 椭圆曲线 1. Design plan of blind signature based on elliptic curve and its application; 基于椭圆曲线的盲签名方案设计及其应用 2. (t,n) Threshold group signature scheme based on elliptic curve cryptosystem; ...
Méloni, N., Hasan, M.A.: Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 304–316. Springer, Heidelberg (2009)Méloni, N., Hasan, M.A.: Elliptic curve scalar multiplication ...
With the advent of Elliptic curve cryptography (ECC); it grew unusually quickly because it had a smaller key size compared with that of the RSA cryptography system. Many researches are being done nowadays to make this type of cryptography more efficient. These investigations are about improving ...
Speeding up the Elliptic Curve Scalar Multiplication Using the Window- w Non Adjacent Form Malaysian Journal of Mathematical SciencesAl Saffar, Najlae Falah HameedMohamad Rushdan Md Said
2) elliptic curve digital signature algorithm(ECDSA) 椭圆曲线数字签名算法 1. The method can improve operation speed and reduce operation time effectively over traditional algorithm,and can be used in elliptic curve digital signature algorithm(ECDSA). 与传统方法相比较,该算法可以有效地提高运算速度,...
Atomicity Improvement for Elliptic Curve Scalar Multiplication Christophe Giraud1 and Vincent Verneuil2,3, 1 Oberthur Technologies, 4, all´ee du doyen Georges Brus, 33 600 Pessac, France c.giraud@oberthur.com 2 Inside Contactless, 41, parc du Golf, 13 856 Aix-en-Provence cedex 3, France ...
Because of its sparsity, triple-base number system is used to accelerate the scalar multiplication in elliptic curve cryptography. Yu et al. presented an estimate for the length of triple-base number system at Africacrypt 2013. However, the efficiency of scalar multiplication is not only ...
When multiplicative splitting is used to hide a scalar in an Elliptic Curve scalar Multiplication ECSM operation, the associated modular division operation employs the known Almost Montgomery Inversion algorithm. By including dummy operations in some of the branches of the main iteration loop of the ...