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

DOI10.1080/09720529.2020.1730512zbMATH Open1492.94118OpenAlexW3018834963MaRDI QIDQ5865701FDOQ5865701

Authors: X. L. 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

Recommendations

• Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
• Parallel \(\mathrm{GF}(3^m)\) multiplier for trinomials
• Mastrovito multiplier for all trinomials
• Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials
• Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm

zbMATH Keywords

trinomialsbit-parallel multiplierthree-term Karatsuba algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Five, six, and seven-term Karatsuba-like formulae
• Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials
• Mastrovito multiplier for all trinomials
• Bit-parallel finite field multiplier and squarer using polynomial basis
• Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype="inline"><tex>$GF(2^{n})$</tex></formula>
• Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials
• 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
• Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials
• On the Complexity of Hybrid $n$ -Term Karatsuba Multiplier for Trinomials

Cited In (5)

• Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials
• On the Complexity of Hybrid $n$ -Term Karatsuba Multiplier for Trinomials
• Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
• Mastrovito multiplier for all trinomials
• Improved three-way split formulas for binary polynomial multiplication

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

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