Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial

DOI10.1016/j.ipl.2011.08.004zbMath1260.11075OpenAlexW2082161294MaRDI QIDQ1944198

Chiou-Yng Lee, Che Wun Chiou, Yun-Chi Yeh

Publication date: 4 April 2013

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

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

zbMATH Keywords

finite fieldcryptographymultiplexermultiplierpolynomial basis

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (1)

Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
• Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm
• 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/)
• Bit-serial Reed - Solomon encoders
• A new architecture for a parallel finite field multiplier with low complexity based on composite fields
• Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials
• Multiplexer-based array multipliers
• Efficient multiplier architectures for Galois fields GF(2/sup 4n/)
• New low-complexity bit-parallel finite field multipliers using weakly dual bases
• Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)
• Computation with finite fields
• A SIGNED BINARY MULTIPLICATION TECHNIQUE

This page was built for publication: Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial