Computation with finite fields

DOI10.1016/S0019-9958(63)90129-3MaRDI QIDQ5724274zbMATH OpenOpenAlexFDO

Authors Thomas C. Bartee, David I. Schneider

Publication date 1963

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(63)90129-3

zbMATH Keywords

probability theory

Cited in

(5)

• A conversion algorithm for logarithms on \(GF(2^n)\)
• Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial
• Arithmetic in a Finite Field
• Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)
• Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)

This page was built for publication: Computation with finite fields

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