A three-term Karatsuba multiplier for a special class of trinomials

DOI10.1080/09720529.2020.1730512zbMath1492.94118OpenAlexW3018834963MaRDI QIDQ5865701

Xiao Li Guo, Yin Li, Yu Zhang

Publication date: 9 June 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2020.1730512

zbMATH Keywords

trinomialsbit-parallel multiplierthree-term Karatsuba algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• A Chinese Remainder Theorem Approach to Bit-Parallel <inline-formula><tex-math>$GF(2^{n})$</tex-math> <alternatives><inline-graphic xlink:type="simple" xlink:href="fan-ieq1-2428704.gif"/></alternatives></inline-formula> Polynomial Basis Multipliers for Irreducible Trinomials
• Five, six, and seven-term Karatsuba-like formulae
• Mastrovito multiplier for all trinomials
• Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials
• Bit-parallel finite field multiplier and squarer using polynomial basis
• Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials
• Fast Bit Parallel-Shifted Polynomial Basis Multipliers in &lt;formula formulatype="inline"&gt;&lt;tex&gt;$GF(2^{n})$&lt;/tex&gt;&lt;/formula&gt;
• On the Complexity of Hybrid $n$ -Term Karatsuba Multiplier for Trinomials
• Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$

This page was built for publication: A three-term Karatsuba multiplier for a special class of trinomials