An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation

DOI10.1016/J.IPL.2004.08.009zbMath1173.68817OpenAlexW1578834396MaRDI QIDQ834951

Ju-Sung Kang, Howon Kim, Ku-Young Chang, Hyun Sook Cho

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.08.009

zbMATH Keywords

algorithmsnormal basisFermat's theoremmultiplicative inversion

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

Complexity of computation in finite fields ⋮ An extension of TYT inversion algorithm in polynomial basis

Cites Work

• Unnamed Item
• Unnamed Item
• 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)
• A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis

This page was built for publication: An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation