Structure of parallel multipliers for a class of fields GF(2^ m)

DOI10.1016/0890-5401(89)90045-XMaRDI QIDQ1124585zbMATHOpenAlexDBLPWikidataFDO

Authors Toshiya Itoh, Shigeo Tsujii

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

zbMATH Keywords

canonical basesall one polynomialAND-gatesEOR-gatesequally spaced polynomialparallel multipliersstructural modularity

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to field theory (12-04)

Recommendations

• scientific article; zbMATH DE number 1878331
• Parallel multipliers based on special irreducible pentanomials
• A modified Massey-Omura parallel multiplier for a class of finite fields
• Efficient bit-parallel multipliers over finite fields GF\((2^m)\)
• Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Architectures for exponentiation in GF(2n)
• Optimal normal bases in \(GF(p^ n)\)
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)

Cited in

(23)

• Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields
• Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF \((2^{m})\) generated by AOPs
• Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials
• Characterization for a family of infinitely many irreducible equally spaced polynomials
• 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 parallel architecture for computing multiplication in \(\text{GF}(2^m)\)
• A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m)
• Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)
• Efficient bit-parallel multipliers over finite fields GF\((2^m)\)
• A modified Massey-Omura parallel multiplier for a class of finite fields
• The circulant hash revisited
• Parallel \(\mathrm{GF}(3^m)\) multiplier for trinomials
• Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial
• Parallel multipliers based on special irreducible pentanomials
• Computational Science and Its Applications – ICCSA 2004
• Extractors for binary elliptic curves
• Montgomery exponent architecture based on programmable cellular automata
• Generalised Mersenne numbers revisited
• Polynomial basis multiplication over \(\text{GF}(2^m)\)
• AOP arithmetic architectures over GF(2\(^m\))
• Semi-systolic Modular Multiplier over GF(2m)
• A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\)

This page was built for publication: Structure of parallel multipliers for a class of fields \(GF(2^ m)\)

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