Pages that link to "Item:Q1124585"

The following pages link to Structure of parallel multipliers for a class of fields \(GF(2^ m)\) (Q1124585):

Displaying 17 items.

• Characterization for a family of infinitely many irreducible equally spaced polynomials (Q750156) (← links)
• Polynomial basis multiplication over \(\text{GF}(2^m)\) (Q850783) (← 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)
• Extractors for binary elliptic curves (Q1009079) (← links)
• Montgomery exponent architecture based on programmable cellular automata (Q1010043) (← links)
• AOP arithmetic architectures over GF(2\(^m\)) (Q1888264) (← links)
• Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198) (← links)
• The circulant hash revisited (Q2033521) (← links)
• Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials (Q2413208) (← links)
• Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF \((2^{m})\) generated by AOPs (Q2432149) (← links)
• Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404) (← links)
• A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) (Q2475900) (← links)
• Semi-systolic Modular Multiplier over GF(2m) (Q3512542) (← links)
• A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m) (Q3628444) (← links)
• Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields (Q4449510) (← links)
• Generalised Mersenne numbers revisited (Q5326517) (← links)