Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials

DOI10.1016/j.ipl.2011.01.005zbMath1260.94095OpenAlexW2078785726MaRDI QIDQ1944906

Gong-Liang Chen, Yin Li, Jian Hua Li

Publication date: 28 March 2013

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

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

zbMATH Keywords

cryptographytrinomialKaratsuba bit-parallel multiplier

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials
• Mastrovito multiplier for all trinomials
• A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
• Parallel multipliers based on special irreducible pentanomials
• A new architecture for a parallel finite field multiplier with low complexity based on composite fields
• A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
• Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
• Bit-parallel finite field multiplier and squarer using polynomial basis
• Montgomery multiplier and squarer for a class of finite fields
• Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype="inline"><tex>$GF(2^{n})$</tex></formula>

This page was built for publication: Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials