A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
Information and Computation
A VLSI Architecture for Fast Inversion in GF(2/sup m/)
IEEE Transactions on Computers
A Fast Algorithm for Multiplicative Inversion in GF(2m) Using Normal Basis
IEEE Transactions on Computers
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
Designs, Codes and Cryptography
Reconfigurable Implementation of Elliptic Curve Crypto Algorithms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2)
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Efficient Computation of Multiplicative Inverses for Cryptographic Applications
ARITH '01 Proceedings of the 15th IEEE Symposium on Computer Arithmetic
A Fast Implementation of Multiplicative Inversion Over GF(2^m )
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
A parallel version of the Itoh-Tsujii multiplicative inversion algorithm
ARC'07 Proceedings of the 3rd international conference on Reconfigurable computing: architectures, tools and applications
Field inversion and point halving revisited
IEEE Transactions on Computers
High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Accelerating Itoh-Tsujii multiplicative inversion algorithm for FPGAs
Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
Fast forth power and its application in inversion computation for a special class of trinomials
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
A simple stream cipher with proven properties
Cryptography and Communications
Generalized high speed Itoh-Tsujii multiplicative inversion architecture for FPGAs
Integration, the VLSI Journal
Faster implementation of scalar multiplication on koblitz curves
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
| Hi-index | 0.00 |
In this contribution, we derive a novel parallel formulation of the standard Itoh---Tsujii algorithm for multiplicative inverse computation over the field GF(2 m ). The main building blocks used by our algorithm are: field multiplication, field squaring and field square root operators. It achieves its best performance when using a special class of irreducible trinomials, namely, P(x) = x m + x k + 1, with m and k odd numbers and when implemented in hardware platforms. Under these conditions, our experimental results show that our parallel version of the Itoh---Tsujii algorithm yields a speedup of about 30% when compared with the standard version of it. Implemented in a Virtex 3200E FPGA device, our design is able to compute multiplicative inversion over GF(2193) after 20 clock cycles in about 0.94 μS.