Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
From MaRDI portal
Publication:1124585
DOI10.1016/0890-5401(89)90045-XzbMath0678.94024OpenAlexW2091095778WikidataQ56453869 ScholiaQ56453869MaRDI QIDQ1124585
Publication date: 1989
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(89)90045-x
canonical basesall one polynomialAND-gatesEOR-gatesequally spaced polynomialparallel multipliersstructural modularity
Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items
AOP arithmetic architectures over GF(2\(^m\)), Polynomial basis multiplication over \(\text{GF}(2^m)\), Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\), Generalised Mersenne numbers revisited, Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials, Semi-systolic Modular Multiplier over GF(2m), Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial, Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF \((2^{m})\) generated by AOPs, Low complexity normal bases for \(F_{2^{mn}}\), Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm, A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\), The circulant hash revisited, Extractors for binary elliptic curves, Montgomery exponent architecture based on programmable cellular automata, A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m), Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields, Characterization for a family of infinitely many irreducible equally spaced polynomials
Cites Work
