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

DOI10.1016/J.IPL.2011.01.005MaRDI QIDQ1944906zbMATH OpenOpenAlexFDO

Authors Yin Li, Gong-Liang Chen, Jianhua 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

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• A three-term Karatsuba multiplier for a special class of trinomials
• Low complexity bit parallel multiplier for GF(2ᵐ) generated by equally-spaced trinomials
• Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
• Parallel \(\mathrm{GF}(3^m)\) multiplier for trinomials
• Information Security and Cryptology - ICISC 2003

Cites work

• scientific article; zbMATH DE number 424718 (Why is no real title available?)
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
• A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
• A new architecture for a parallel finite field multiplier with low complexity based on composite fields
• 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>
• Low complexity bit parallel multiplier for GF(2ᵐ) generated by equally-spaced trinomials
• Mastrovito multiplier for all trinomials
• Montgomery multiplier and squarer for a class of finite fields
• Parallel multipliers based on special irreducible pentanomials
• Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases

Cited in

(7)

• Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
• A three-term Karatsuba multiplier for a special class of trinomials
• On the Complexity of Hybrid $n$ -Term Karatsuba Multiplier for Trinomials
• Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$
• Low complexity bit parallel multiplier for GF(2ᵐ) generated by equally-spaced trinomials
• Information Security
• Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition

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

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