Bit Serial Multiplication in Finite Fields

DOI10.1137/0403012MaRDI QIDQ3472206zbMATH OpenOpenAlexFDO

Authors Muzhong Wang, Ian Blake

Publication date 1990

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0403012

zbMATH Keywords

Bit serial multiplication schemesdigital circuitryfinite field of characteristic twopolynomial bases in finite fields

Mathematics Subject Classification ID

Arithmetic theory of polynomial rings over finite fields (11T55) Software, source code, etc. for problems pertaining to field theory (12-04) Theory of software (68N99)

Recommendations

• Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware
• Arithmetic of binary finite fields
• scientific article; zbMATH DE number 1583946
• On bit-serial multiplication and dual bases in GF(2/sup m/)
• GF(2/sup m/) multiplication and division over the dual basis

Cited in

(11)

• Self-dual bases in \(\mathbb{F}_{q^ n}\)
• Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware
• Linear sets on the projective line with complementary weights
• A new characterization of dual bases in finite fields and its applications
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Arithmetic of binary finite fields
• Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields
• Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields
• scientific article; zbMATH DE number 1979306 (Why is no real title available?)
• scientific article; zbMATH DE number 1419236 (Why is no real title available?)
• Efficient hardware implementation of finite fields with applications to cryptography

This page was built for publication: Bit Serial Multiplication in Finite Fields

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