A parallel architecture for computing multiplication in GF(2ᵐ)
From MaRDI portal
Publication:5483639
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Cryptography (94A60)
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)
Cited in
(10)- Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic
- scientific article; zbMATH DE number 1583946 (Why is no real title available?)
- VLSI algorithms, architectures, and implementation of a versatile GF(2/sup m/) processor
- Parallel multipliers based on special irreducible pentanomials
- Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
- A new architecture for a parallel finite field multiplier with low complexity based on composite fields
- 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/)
- Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m)
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)
