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

DOI10.1049/EL:19880226MaRDI QIDQ4206832zbMATH OpenOpenAlexFDO

Authors 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

multiplicative inversesnormal bases

Mathematics Subject Classification ID

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

Recommendations

• Generalised fast algorithm for computing multiplicative inverses inGF(2^m)
• An efficient algorithm for computing inverses in \(\text{GF}(2^{m})\) using dual bases
• scientific article; zbMATH DE number 39192
• Computational Science and Its Applications – ICCSA 2004
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases

Cited in

(7)

• An efficient algorithm for computing inverses in \(\text{GF}(2^{m})\) using dual bases
• The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime
• Generalised fast algorithm for computing multiplicative inverses inGF(2^m)
• Computing special powers in finite fields
• On computing multiplicative inverses in GF(2/sup m/)
• Computational Science and Its Applications – ICCSA 2004
• An extension of TYT algorithm for GF((2ⁿ)^m) using precomputation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4206832)