scientific article; zbMATH DE number 5504474
From MaRDI portal
Publication:3597518
Cited in
(8)- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- Synthesis for Unbounded Bit-Vector Arithmetic
- scientific article; zbMATH DE number 5708383 (Why is no real title available?)
- scientific article; zbMATH DE number 1504817 (Why is no real title available?)
- Bit-parallel finite field multiplier and squarer using polynomial basis
- Fast and Efficient Circuit Topologies forFinding the Maximum of n k-Bit Numbers
- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
- Hardware implementation of finite-field division
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597518)