Effective recursive algorithm for computing multiplicative inverses in GF(2m)

DOI10.1049/el:19880226zbMath0688.12008OpenAlexW2091844488MaRDI QIDQ4206832

Toshiya Itoh, Shigeo Tsujii

Publication date: 1988

Published in: Electronics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1049/el:19880226

zbMATH Keywords

normal basesmultiplicative inverses

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite fields and commutative rings (number-theoretic aspects) (11T99) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (2)

An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation ⋮ Computing special powers in finite fields

This page was built for publication: Effective recursive algorithm for computing multiplicative inverses in GF(2m)