Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
From MaRDI portal
Publication:1124585
DOI10.1016/0890-5401(89)90045-XzbMath0678.94024WikidataQ56453869 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 bases; all one polynomial; AND-gates; EOR-gates; equally spaced polynomial; parallel multipliers; structural modularity
11T06: Polynomials over finite fields
12-04: Software, source code, etc. for problems pertaining to field theory
Related Items
Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields, Generalised Mersenne numbers revisited, Characterization for a family of infinitely many irreducible equally spaced polynomials, Polynomial basis multiplication over \(\text{GF}(2^m)\), Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\), Low complexity normal bases for \(F_{2^{mn}}\), Extractors for binary elliptic curves, Montgomery exponent architecture based on programmable cellular automata, AOP arithmetic architectures over GF(2\(^m\)), Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial, The circulant hash revisited, Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials, Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF \((2^{m})\) generated by AOPs, 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)\), Semi-systolic Modular Multiplier over GF(2m), A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m)
Cites Work
