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

DOI10.1016/J.IPL.2004.08.009MaRDI QIDQ834951zbMATH OpenOpenAlexFDO

Authors Ku-Young Chang, Howon Kim, Ju-Sung Kang, 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)

Recommendations

• An improvement of the TYT algorithm for \(\mathrm{GF}(2^m)\) based on reusing intermediate computation results
• An extension of TYT inversion algorithm in polynomial basis
• An efficient algorithm for computing inverses in \(\text{GF}(2^{m})\) using dual bases
• scientific article; zbMATH DE number 39192
• scientific article; zbMATH DE number 24470

Cites work

• scientific article; zbMATH DE number 1088245 (Why is no real title available?)
• scientific article; zbMATH DE number 1759279 (Why is no real title available?)
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
• Effective recursive algorithm for computing multiplicative inverses in GF(2m)

Cited in

(3)

• Complexity of computation in finite fields
• An improvement of the TYT algorithm for \(\mathrm{GF}(2^m)\) based on reusing intermediate computation results
• An extension of TYT inversion algorithm in polynomial basis

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

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