Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic
作者： Tetsutaro Kobayashi , Hikaru Morita , Kunio Kobayashi , Fumitaka Hoshino
关键词:
摘要: A new elliptic curve scalar multiplication algorithm is proposed. The offers about twice the troughput of some conventional OEF-base algorithms because it combines Frobenius map with table reference method based on base-φ expansion. Furthermore, since this suits computational units such as 16, 32 and 64 bits, its base field Fpm expected to enhance operation efficiency more than Fq (q a prime) or F2n.
springer.com
sci-hub.st 参考文章(21)
Joseph H. Silverman, The Arithmetic of Elliptic Curves ,(1986)
Neal Koblitz, An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm international cryptology conference. pp. 327- 337 ,(1998) , 10.1007/BFB0055739
Jerome A. Solinas, An Improved Algorithm for Arithmetic on a Family of Elliptic Curves international cryptology conference. pp. 357- 371 ,(1997) , 10.1007/BFB0052248
Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David B. Wilson, Fast exponentiation with precomputation theory and application of cryptographic techniques. pp. 200- 207 ,(1992) , 10.1007/3-540-47555-9_18
Erik De Win, Antoon Bosselaers, Servaas Vandenberghe, Peter De Gersem, Joos Vandewalle, A Fast Software Implementation for Arithmetic Operations in GF(2n) international cryptology conference. pp. 65- 76 ,(1996) , 10.1007/BFB0034836
Michael J. Wiener, Robert J. Zuccherato, Faster Attacks on Elliptic Curve Cryptosystems selected areas in cryptography. pp. 190- 200 ,(1998) , 10.1007/3-540-48892-8_15
Henri Cohen, Atsuko Miyaji, Takatoshi Ono, Efficient Elliptic Curve Exponentiation Using Mixed Coordinates international cryptology conference. pp. 51- 65 ,(1998) , 10.1007/3-540-49649-1_6
Volker Müller, Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two Journal of Cryptology. ,vol. 11, pp. 219- 234 ,(1998) , 10.1007/S001459900045
R.C. Mullin, I.M. Onyszchuk, S.A. Vanstone, R.M. Wilson, Optimal normal bases in GF( p n ) Discrete Applied Mathematics. ,vol. 22, pp. 149- 161 ,(1989) , 10.1016/0166-218X(88)90090-X
Jung Hee Cheon, Sungmo Park, Sangwoo Park, Daeho Kim, Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map public key cryptography. pp. 195- 202 ,(1998) , 10.1007/BFB0054025