Efficient multi-bit shifting algorithm in multiplicative inversion problems

Authors:
Injoo Jang;Hyeong Seon Yoo
Affiliations:
School of Computer Science and Engineering, Inha University, Incheon, Korea;School of Computer Science and Engineering, Inha University, Incheon, Korea
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Year:
2005

Citing 7
Cited 0

A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

Information and Computation
Montgomery Multiplication in GF(2^k

Designs, Codes and Cryptography
Implementing elliptic curve cryptography

Implementing elliptic curve cryptography
The Montgomery Modular Inverse-Revisited

IEEE Transactions on Computers - Special issue on computer arithmetic
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes

Designs, Codes and Cryptography
The Montgomery Inverse and Its Applications

IEEE Transactions on Computers
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an efficient inversion algorithm for Galois field GF(2n) by using a modified multi-bit shifting method. It is well known that the efficiency of arithmetic algorithms depends on the basis and many foregoing papers use either polynomial or optimal normal basis. An inversion algorithm, which modifies a multi-bit shifting based on the Montgomery algorithm, is studied. Trinomials and AOPs (all-one polynomials) are tested to calculate the inverse. It is shown that the suggested inversion algorithm reduces the computation time 1 ~ 26% of the forgoing multi-bit shifting algorithm. The modified algorithm can be applied in various applications and is easy to implement.