VLSI Architectures for Computing Multiplications and Inverses in GF(2m)

Recommendations

VLSI algorithms, architectures, and implementation of a versatile GF(2/sup m/) processor
scientific article; zbMATH DE number 4102996
Scalable and Unified Digit-Serial Processor Array Architecture for Multiplication and Inversion Over GF( $2^{m}$ )
A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/)
A parallel architecture for computing multiplication in $\text{GF}(2^m)$
scientific article; zbMATH DE number 1997929
A new hardware architecture for operations in GF(2/sup n/)
A class of unidirectional bit serial systolic architectures for multiplicative inversion and division over GF(2/sup m/)
Architectures for exponentiation in GF(2n)

Cited in

(36)

Low complexity normal bases for $F_{2^{mn}}$
scientific article; zbMATH DE number 3859036 (Why is no real title available?)
Optimal normal bases in $GF(p^ n)$
Constructing normal bases in finite fields
On comparison and analysis of algorithms for multiplication in $\mathrm{GF}(2^m)$
Novel approaches to the design of VLSI RNS multipliers
scientific article; zbMATH DE number 3958728 (Why is no real title available?)
scientific article; zbMATH DE number 1997929 (Why is no real title available?)
A Euclidean algorithm for normal bases
Scalable and systolic architecture for computing double exponentiation over $\text{GF}(2^m)$
A fast algorithm for computing multiplicative inverses in $\text{GF}(2^ m)$ using normal bases
scientific article; zbMATH DE number 17850 (Why is no real title available?)
scientific article; zbMATH DE number 2024675 (Why is no real title available?)
A VLSI design for computing exponentiations in GF(2/sup m/) and its application to generate pseudorandom number sequences
An extension of TYT inversion algorithm in polynomial basis
Processor-efficient exponentiation in finite fields
Polynomial division using left shift register
scientific article; zbMATH DE number 4102996 (Why is no real title available?)
scientific article; zbMATH DE number 125164 (Why is no real title available?)
WG: a family of stream ciphers with designed randomness properties
Design of a linear systolic array for computing modular multiplication and squaring in $\text{GF}(2^m)$
Algebraic decoding of the (41, 21, 9) quadratic residue code
scientific article; zbMATH DE number 1950621 (Why is no real title available?)
A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/)
Characterization for a family of infinitely many irreducible equally spaced polynomials
A fast algorithm to compute irreducible and primitive polynomials in finite fields
scientific article; zbMATH DE number 1526199 (Why is no real title available?)
Structure of parallel multipliers for a class of fields GF(2^ m)
Algorithm and architecture for a Galois field multiplicative arithmetic processor
Highly efficient $\mathrm{GF}(2^8)$ inversion circuit based on redundant GF arithmetic and its application to AES design
On the decoding of the $(24, 12, 8)$ Golay code
Efficient and optimal exponentiation in finite fields
The generation of rimitive olynomials in GF(q) with independent roots and their applications for ower residue codes, VLSI testing and finite field multipliers using normal basis
High speed decoding of the binary $(47, 24, 11)$ quadratic residue code
VLSI algorithms, architectures, and implementation of a versatile GF(2/sup m/) processor
Computing special powers in finite fields

This page was built for publication: VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)

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