An efficient algorithm for computing inverses in GF(2ᵐ) using dual bases

DOI10.1007/3-540-44864-0_103MaRDI QIDQ3569058zbMATH OpenOpenAlexFDO

Authors Hyeong Seon Yoo, Seokung Yoon, Eui Sun Kim

Publication date 17 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44864-0_103

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Recommendations

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

Cited in

(16)

• Arithmetic operations in \(GF(2^ m)\)
• Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
• Algorithm for squaring in GF(2m) in standard basis
• Efficient computing of some vector operations over \(\mathrm{GF}(3)\) and \(\mathrm{GF}(4)\)
• The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime
• An improvement of the TYT algorithm for \(\mathrm{GF}(2^m)\) based on reusing intermediate computation results
• scientific article; zbMATH DE number 24470 (Why is no real title available?)
• scientific article; zbMATH DE number 39192 (Why is no real title available?)
• Effective recursive algorithm for computing multiplicative inverses in GF(2m)
• Generalised fast algorithm for computing multiplicative inverses inGF(2^m)
• scientific article; zbMATH DE number 1341863 (Why is no real title available?)
• On computing multiplicative inverses in GF(2/sup m/)
• Binary algorithms for multiplicative inversion
• Computational Science and Its Applications – ICCSA 2004
• An extension of TYT algorithm for GF((2ⁿ)^m) using precomputation
• On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime

This page was built for publication: An efficient algorithm for computing inverses in \(\text{GF}(2^{m})\) using dual bases

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