Novel bit-parallel multiplier for GF(2ᵐ) defined by all-one polynomial using generalized Karatsuba algorithm
DOI10.1016/J.IPL.2013.10.009zbMATH Open1284.68723OpenAlexW2082754925MaRDI QIDQ2445404FDOQ2445404
Authors: Xiao-Ning Xie, Gong-Liang Chen, Yin Li 
Publication date: 14 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.10.009
Recommendations
- scientific article; zbMATH DE number 1878331
- A new architecture for a parallel finite field multiplier with low complexity based on composite fields
- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- Efficient bit-parallel multipliers over finite fields GF\((2^m)\)
cryptographyredundant representationbit-parallel multiplierall-one polynomialgeneralized Karatsuba algorithm
Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Cryptography (94A60) Analytic circuit theory (94C05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Five, six, and seven-term Karatsuba-like formulae
- A modified Massey-Omura parallel multiplier for a class of finite fields
- Parallel multipliers based on special irreducible pentanomials
- Low complexity bit-parallel multipliers for a class of finite fields
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
- 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
- Title not available (Why is that?)
- Multiplexer-based array multipliers
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial
- A new hardware architecture for operations in GF(2/sup n/)
Cited In (11)
- A new architecture for a parallel finite field multiplier with low complexity based on composite fields
- AOP arithmetic architectures over GF(2\(^m\))
- A three-term Karatsuba multiplier for a special class of trinomials
- A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
- Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic
- Computational Science and Its Applications – ICCSA 2004
- Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$
- Combining multiplication methods with optimized processing sequence for polynomial multiplier in \(\mathrm{GF}(2^k)\)
- Information Security
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial
- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
This page was built for publication: Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445404)
