Pages that link to "Item:Q3682399"
From MaRDI portal
The following pages link to VLSI Architectures for Computing Multiplications and Inverses in GF(2<sup>m</sup>) (Q3682399):
Displayed 20 items.
- On the decoding of the \((24, 12, 8)\) Golay code (Q621601) (← links)
- Efficient and optimal exponentiation in finite fields (Q685709) (← links)
- Algebraic decoding of the \((41, 21, 9)\) quadratic residue code (Q730938) (← links)
- Characterization for a family of infinitely many irreducible equally spaced polynomials (Q750156) (← links)
- A Euclidean algorithm for normal bases (Q850785) (← links)
- Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) (← links)
- Low complexity normal bases for \(F_{2^{mn}}\) (Q918710) (← links)
- An extension of TYT inversion algorithm in polynomial basis (Q991790) (← links)
- Optimal normal bases in \(GF(p^ n)\) (Q1112879) (← links)
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases (Q1120276) (← links)
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\) (Q1124585) (← links)
- Polynomial division using left shift register (Q1130425) (← links)
- Processor-efficient exponentiation in finite fields (Q1186580) (← links)
- WG: a family of stream ciphers with designed randomness properties (Q2476897) (← links)
- High speed decoding of the binary \((47, 24, 11)\) quadratic residue code (Q2638202) (← links)
- Constructing normal bases in finite fields (Q2639102) (← links)
- 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 (Q3984332) (← links)
- A fast algorithm to compute irreducible and primitive polynomials in finite fields (Q4327377) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\) (Q5948833) (← links)