Fast forth power and its application in inversion computation for a special class of trinomials
作者： Yin Li , Gong-liang Chen , Jian-hua Li
DOI: 10.1007/978-3-642-12165-4_2
关键词:
摘要: This contribution is concerned with an improvement of Itoh and Tsujii's algorithm for inversion in finite field GF(2m) using polynomial basis. Unlike the standard version this algorithm, proposed uses forth power multiplication as main operations. When generated a special class irreducible trinomials, analytical form fast bit-parallel operation presented. The proposal can save 1TX compared classic approach, where TX delay one 2-input XOR gate. Based on result, achieves even faster performance, roughly improves by $\frac{m}{2}T_X$, at cost slight increase space complexity version. To best our knowledge, first work that proposes use computation multiplicative inverse basis shows it be efficient.
springer.com
sci-hub.st 参考文章(14)
Preda Mihailescu, F Pappalardi, Elliptic Curves in Cryptography ,(1999)
Jorge Guajardo, Christof Paar, Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes Designs, Codes and Cryptography. ,vol. 25, pp. 207- 216 ,(2002) , 10.1023/A:1013860532636
Wang, Troung, Shao, Deutsch, Omura, Reed, VLSI Architectures for Computing Multiplications and Inverses in GF(2 m ) IEEE Transactions on Computers. ,vol. 34, pp. 709- 717 ,(1985) , 10.1109/TC.1985.1676616
Raymond G. Kammer, William M. Daley, Digital Signature Standard (DSS) ,(2000)
Toshiya Itoh, Shigeo Tsujii, A fast algorithm for computing multiplicative inverses in GF(2 m ) using normal bases Information & Computation. ,vol. 78, pp. 171- 177 ,(1988) , 10.1016/0890-5401(88)90024-7
Zhiyuan Yan, D.V. Sarwate, New systolic architectures for inversion and division in GF(2/sup m/) IEEE Transactions on Computers. ,vol. 52, pp. 1514- 1519 ,(2003) , 10.1109/TC.2003.1244950
Francisco Rodríguez-Henríquez, Guillermo Morales-Luna, Nazar A. Saqib, Nareli Cruz-Cortés, Parallel Itoh---Tsujii multiplicative inversion algorithm for a special class of trinomials Designs, Codes and Cryptography. ,vol. 45, pp. 19- 37 ,(2007) , 10.1007/S10623-007-9073-6
Haining Fan, Yiqi Dai, Fast bit-parallel GF(2/sup n/) multiplier for all trinomials IEEE Transactions on Computers. ,vol. 54, pp. 485- 490 ,(2005) , 10.1109/TC.2005.64
Apostolos P. Fournaris, O. Koufopavlou, Applying systolic multiplication-inversion architectures based on modified extended Euclidean algorithm for GF(2k) in elliptic curve cryptography Computers & Electrical Engineering. ,vol. 33, pp. 333- 348 ,(2007) , 10.1016/J.COMPELECENG.2007.05.001
Berk Sunar, Cetin Kaya Koc, An efficient optimal normal basis type II multiplier IEEE Transactions on Computers. ,vol. 50, pp. 83- 87 ,(2001) , 10.1109/12.902754