An extension of TYT inversion algorithm in polynomial basis

DOI10.1016/J.IPL.2010.02.006zbMath1209.68619OpenAlexW2092683450MaRDI QIDQ991790

Yi-Yang Chen, Gong-Liang Chen, Yin Li, Jian Hua Li

Publication date: 7 September 2010

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

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

zbMATH Keywords

algorithmsmultiplicative inversepolynomial basisTYT

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (1)

A simple stream cipher with proven properties

Cites Work

• Unnamed Item
• Unnamed Item
• An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation
• Optimal normal bases in \(GF(p^ n)\)
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• An efficient optimal normal basis type II multiplier
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
• A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
• Mastrovito multiplier for all trinomials
• A modified Massey-Omura parallel multiplier for a class of finite fields
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
• Bit-parallel finite field multiplier and squarer using polynomial basis
• A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
• On Orders of Optimal Normal Basis Generators

This page was built for publication: An extension of TYT inversion algorithm in polynomial basis