An extension of TYT algorithm for GF((2n)m) using precomputation

Authors:
Ku-Young Chang;Howon Kim;Ju-Sung Kang;Hyun-Sook Cho
Affiliations:
Information Security Research Division, Electronics and Telecommunications Research Institute, 161 Gajeong-Dong, Yuseong-Gu, Daejeon 305-350, Republic of Korea;Information Security Research Division, Electronics and Telecommunications Research Institute, 161 Gajeong-Dong, Yuseong-Gu, Daejeon 305-350, Republic of Korea;Kookmin University, 861-1, Chongnung-dong, Songbuk-gu, Seoul 136-702, Republic of Korea;Information Security Research Division, Electronics and Telecommunications Research Institute, 161 Gajeong-Dong, Yuseong-Gu, Daejeon 305-350, Republic of Korea
Venue:
Information Processing Letters
Year:
2004

Citing 3
Cited 1

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

Information and Computation
A Fast Algorithm for Multiplicative Inversion in GF(2m) Using Normal Basis

IEEE Transactions on Computers
Efficient Algorithms for Elliptic Curve Cryptosystems

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology

An extension of TYT inversion algorithm in polynomial basis

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this letter, we present a fast inversion algorithm in GF((2^n)^m) which improves the previous algorithms for multiplicative inversion in GF(2^m) using normal basis such as IT algorithm and TYT algorithm. The proposed algorithm reduces the number of multiplications required to compute the multiplicative inversion by precomputing the inversion in GF(2^n) for small value n and then by decomposing m-1 into several factors and a small remainder.