Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials

DOI10.1016/J.IPL.2008.01.012zbMath1191.94101OpenAlexW2008676925MaRDI QIDQ963444

Yier Jin, Hai-Bin Shen

Publication date: 19 April 2010

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

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

zbMATH Keywords

cryptographyKaratsuba methodbit-parallel multiplierequally-spaced trinomial (EST)shifted polynomial basis (SPB)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials ⋮ A three-term Karatsuba multiplier for a special class of trinomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Finite field multiplier using redundant representation
• Montgomery multiplier and squarer for a class of finite fields
• New low-complexity bit-parallel finite field multipliers using weakly dual bases

This page was built for publication: Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials