Computation with finite fields

DOI10.1016/S0019-9958(63)90129-3zbMath0115.35802OpenAlexW2081934516MaRDI QIDQ5724274

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

Related Items (5)

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

This page was built for publication: Computation with finite fields