A Parallel Quad Itoh-Tsujii Multiplicative Inversion Algorithm for FPGA Platforms

Modular inversion in GF (2m) is one of the computationally intensive tasks in cryptographic applications like Elliptic Curve Cryptography (ECC). For hardware implementation over binary extended field, Itoh- Tsujii inversion Algorithm (ITA) using sequential multiplication and squaring is considered as the most efficient algorithm. In this paper, we propose a new parallel Quad ITA(QITA) over the National Institute of Standards and Technology (NIST) recommended trinomials to efficiently compute inverse operation on Field-Programmable Gate-Array (FPGA) platforms. Due to the implementation of novel short length addition chain and parallel Quadblock, area-time efficiency has been enhanced in this architecture. This modification allows the computation of inversion with reduced clock cycles comparatively. The experimental results reveal that the proposed parallel QITA algorithm improves the area-time performance as compared to other existing works.

[1]  Chester Rebeiro,et al.  Generalized high speed Itoh-Tsujii multiplicative inversion architecture for FPGAs , 2012, Integr..

[2]  Kazuyoshi Takagi,et al.  A Fast Algorithm for Multiplicative Inversion in GF(2m) Using Normal Basis , 2001, IEEE Trans. Computers.

[3]  Zhe Li,et al.  Speed-Oriented Architecture for Binary Field Point Multiplication on Elliptic Curves , 2019, IEEE Access.

[4]  Mohammed Benaissa,et al.  High-Speed and Low-Latency ECC Processor Implementation Over GF( $2^{m})$ on FPGA , 2017, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[5]  Chester Rebeiro,et al.  Revisiting the Itoh-Tsujii Inversion Algorithm for FPGA Platforms , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[6]  Guillermo Morales-Luna,et al.  Parallel Itoh–Tsujii multiplicative inversion algorithm for a special class of trinomials , 2007, Des. Codes Cryptogr..

[7]  Francisco Rodríguez-Henríquez,et al.  A fast implementation of multiplicative inversion over GF(2/sup m/) , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[8]  Toshiya Itoh,et al.  Generalised fast algorithm for computing multiplicative inverses in GF(2/sup m/) , 1989 .

[9]  V. R. Venkatasubramani,et al.  An improved quad Itoh-Tsujii algorithm for FPGAs , 2013, IEICE Electron. Express.

[10]  Wei Gao,et al.  A Fast Modular Inversion FPGA Implementation over GF(2m) using Modified x2n Unit , 2018, 2018 IEEE International Symposium on Circuits and Systems (ISCAS).

[11]  Jizeng Wei,et al.  Fast and Generic Inversion Architectures Over $\mbox{GF}(2^m)$ Using Modified Itoh–Tsujii Algorithms , 2015, IEEE Transactions on Circuits and Systems II: Express Briefs.

[12]  Antonio García,et al.  Minimum-clock-cycle Itoh-Tsujii algorithm hardware implementation for cryptography applications over GF(2m) fields , 2012 .