An improvement of the TYT algorithm for GF(2ᵐ) based on reusing intermediate computation results

DOI10.4310/CMS.2011.V9.N1.A13MaRDI QIDQ390246zbMATH OpenFDO

Authors Gong-Liang Chen, Yi-Yang Chen, Yin Li, Jianhua Li

Publication date 22 January 2014

Published in Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL http://intlpress.com/site/pub/pages/journals/items/cms/content/vols/0009/0001/a013/index.html

zbMATH Keywords

IT algorithmmultiplicative inverseoptimal decompositionTYT algorithm

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Mathematical problems of computer architecture (68M07) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• An extension of TYT algorithm for GF((2ⁿ)^m) using precomputation
• An efficient algorithm for computing inverses in \(\text{GF}(2^{m})\) using dual bases
• An extension of TYT inversion algorithm in polynomial basis
• Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
• Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)

Cited in

(7)

• Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
• Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
• Optimal Extension Field Inversion in the Frequency Domain
• Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)
• Polynomial inversion algorithms in constant time for post-quantum cryptography
• An extension of TYT algorithm for GF((2ⁿ)^m) using precomputation
• An extension of TYT inversion algorithm in polynomial basis

This page was built for publication: An improvement of the TYT algorithm for \(\mathrm{GF}(2^m)\) based on reusing intermediate computation results

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