Bit Serial Multiplication in Finite Fields
From MaRDI portal
Publication:3472206
DOI10.1137/0403012zbMath0696.12014OpenAlexW2055101016MaRDI QIDQ3472206
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
finite field of characteristic twoBit serial multiplication schemesdigital circuitrypolynomial bases in finite fields
Arithmetic theory of polynomial rings over finite fields (11T55) Theory of software (68N99) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (5)
Linear sets on the projective line with complementary weights ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ A new characterization of dual bases in finite fields and its applications ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Self-dual bases in \(\mathbb{F}_{q^ n}\)
This page was built for publication: Bit Serial Multiplication in Finite Fields