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

DOI10.1109/12.238496MaRDI QIDQ5375329zbMATH OpenOpenAlexFDO

Authors Hannes Brunner, Andreas Curiger, Max Hofstetter

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

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

Recommendations

• Generalised fast algorithm for computing multiplicative inverses inGF(2^m)
• Effective recursive algorithm for computing multiplicative inverses in GF(2m)
• Computational Science and Its Applications – ICCSA 2004
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• 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
• On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime
• On Calculating Multiplicative Inverses Modulo $2^{m}$
• A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
• On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\)

Cited in

(5)

• 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)
• A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/)
• scientific article; zbMATH DE number 5041296 (Why is no real title available?)
• 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)