On computing multiplicative inverses in GF(2/sup m/)

DOI10.1109/12.238496zbMATH Open1395.68143OpenAlexW2075054028MaRDI QIDQ5375329

Max Hofstetter, Hannes Brunner, Andreas Curiger

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.238496

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)

Related Items (5)

The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime ⋮ A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/) ⋮ Title not available (Why is that?) ⋮ Computational Science and Its Applications – ICCSA 2004 ⋮ Generalised fast algorithm for computing multiplicative inverses inGF(2^m)

Recommendations

• On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime 👍 👎
• On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\) 👍 👎
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases 👍 👎
• An Efficient Algorithm for Computing Inverses in GF(2m) Using Dual Bases 👍 👎
• The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime 👍 👎
• Effective recursive algorithm for computing multiplicative inverses in GF(2m) 👍 👎
• Generalised fast algorithm for computing multiplicative inverses inGF(2^m) 👍 👎
• On Calculating Multiplicative Inverses Modulo $2^{m}$ 👍 👎
• A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis 👍 👎
• Computational Science and Its Applications – ICCSA 2004 👍 👎

This page was built for publication: On computing multiplicative inverses in GF(2/sup m/)

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