A parallel architecture for computing multiplication in GF(2ᵐ)
From MaRDI portal
Publication:5483639
zbMATH Open1097.94042MaRDI QIDQ5483639FDOQ5483639
Authors: Danshou Yuan, Mengtian Rong, Bo Chen 
Publication date: 23 August 2006
Recommendations
- A new architecture for a parallel finite field multiplier with low complexity based on composite fields
- Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic
- A modified Massey-Omura parallel multiplier for a class of finite fields
- A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cited In (10)
- A new architecture for a parallel finite field multiplier with low complexity based on composite fields
- Parallel multipliers based on special irreducible pentanomials
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
- Title not available (Why is that?)
- Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic
- Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields
- A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/)
- Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
- Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m)
- VLSI algorithms, architectures, and implementation of a versatile GF(2/sup m/) processor
This page was built for publication: A parallel architecture for computing multiplication in \(\text{GF}(2^m)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483639)
