The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime

DOI10.1109/TC.1986.1676791zbMATH Open0587.12010MaRDI QIDQ3714154

Author name not available (Why is that?)

Publication date: 1986

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

zbMATH Keywords

finite fieldsMersenne primemultiplicative inverseEuclid's algorithmmodified Euclidean algorithm

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99) Arithmetic theory of polynomial rings over finite fields (11T55) Discrete mathematics in relation to computer science (68R99) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (4)

Computational Science and Its Applications – ICCSA 2004 ⋮ On computing multiplicative inverses in GF(2/sup m/) ⋮ Generalised fast algorithm for computing multiplicative inverses inGF(2^m) ⋮ On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers

Recommendations

• On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime 👍 👎
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases 👍 👎
• Efficient arithmetic in (pseudo-)Mersenne prime order fields 👍 👎
• An Efficient Algorithm for Computing Inverses in GF(2m) Using Dual Bases 👍 👎
• 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}$ 👍 👎
• On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers 👍 👎
• On computing multiplicative inverses in GF(2/sup m/) 👍 👎
• Computational Science and Its Applications – ICCSA 2004 👍 👎

This page was built for publication: The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime

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