Parallel Itoh–Tsujii multiplicative inversion algorithm for a special class of trinomials
- 16 June 2007
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 45 (1) , 19-37
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Parallel Version of the Itoh-Tsujii Multiplicative Inversion Algorithm2007
- A fast parallel implementation of elliptic curve point multiplication over GF(2m)Microprocessors and Microsystems, 2004
- Field inversion and point halving revisitedIEEE Transactions on Computers, 2004
- Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2n)2003
- An energy-efficient reconfigurable public-key cryptography processorIEEE Journal of Solid-State Circuits, 2001
- A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basisIEEE Transactions on Computers, 2001
- Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis1999
- Improved normal basis inversion in GF (2
m
)Electronics Letters, 1997
- A VLSI architecture for fast inversion in GF(2/sup m/)IEEE Transactions on Computers, 1989
- A fast algorithm for computing multiplicative inverses in GF(2m) using normal basesInformation and Computation, 1988