Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes

Authors:
Jorge Guajardo;Christof Paar
Affiliations:
ECE Department, Worcester Polytechnic Institute, 100 Institute Road, Worcester, MA 01609, USAguajardo@ece.wpi.edu;ECE Department, Worcester Polytechnic Institute, 100 Institute Road, Worcester, MA 01609, USAchristof@ece.wpi.edu
Venue:
Designs, Codes and Cryptography
Year:
2002

Citing 14
Cited 25

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

Information and Computation
Hyperelliptic cryptosystems

Journal of Cryptology
Structure of parallel multipliers for a class of fields GF(2m)

Information and Computation
Characterization for a family of infinitely many irreducible equally spaced polynomials

Information Processing Letters
Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2/sup m/)

IEEE Transactions on Computers - Special issue on computer arithmetic
Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields

IEEE Transactions on Computers
A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields

IEEE Transactions on Computers
Efficient Algorithms for Elliptic Curve Cryptosystems

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Fast Software Implementation for Arithmetic Operations in GF(2n)

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Fast Key Exchange with Elliptic Curve Systems

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits

IEEE Transactions on Computers
Optimal Tower Fields

IEEE Transactions on Computers
Efficient Computation of Roots in Finite Fields

Designs, Codes and Cryptography
Parallel Itoh---Tsujii multiplicative inversion algorithm for a special class of trinomials

Designs, Codes and Cryptography
An alternative approach to modulo-multiplication for finite fields using the Itoh-Tsujii algorithm

MATH'05 Proceedings of the 7th WSEAS International Conference on Applied Mathematics
Optimal Extension Field Inversion in the Frequency Domain

WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field

Journal of Systems Architecture: the EUROMICRO Journal
Efficient inversion algorithm for optimal normal bases type II

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
An efficient algorithm for computing inverses in GF(2m) using dual bases

ICCS'03 Proceedings of the 2003 international conference on Computational science
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
Hardware performance characterization of block cipher structures

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
High speed modular divider based on GCD algorithm

ICICS'07 Proceedings of the 9th international conference on Information and communications security
Elliptic curves cryptosystems for ecommerce applications

MCBE'10/MCBC'10 Proceedings of the 11th WSEAS international conference on mathematics and computers in business and economics and 11th WSEAS international conference on Biology and chemistry
An analysis of affine coordinates for pairing computation

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
On efficient implementation of accumulation in finite field over GF(2m) and its applications

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Accelerating Itoh-Tsujii multiplicative inversion algorithm for FPGAs

Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
An alternative approach to modulo-multiplication for finite fields using the Itoh-Tsujii algorithm

AEE'05 Proceedings of the 4th WSEAS international conference on Applications of electrical engineering
An alternative approach to modulo-multiplication for finite fields using the Itoh-Tsujii algorithm

ICAI'05/MCBC'05/AMTA'05/MCBE'05 Proceedings of the 6th WSEAS international conference on Automation & information, and 6th WSEAS international conference on mathematics and computers in biology and chemistry, and 6th WSEAS international conference on acoustics and music: theory and applications, and 6th WSEAS international conference on Mathematics and computers in business and economics
Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication

CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Provably secure masking of AES

SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Efficient multi-bit shifting algorithm in multiplicative inversion problems

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Accelerating inverse of GF(2n) with precomputation

ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
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
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

This contribution is concerned with a generalization of Itoh and Tsujii's algorithm for inversion in extension fields GF(q^m). Unlike the original algorithm, the method introduced here uses a standard (or polynomial) basis representation. The inversion method is generalized for standard basis representation and relevant complexity expressions are established, consisting of the number of extension field multiplications and exponentiations. As the main contribution, for three important classes of fields we show that the Frobenius map can be explored to perform the exponentiations required for the inversion algorithm efficiently. As an important consequence, Itoh and Tsujii's inversion method shows almost the same practical complexity for standard basis as for normal basis representation for the field classes considered.