Mastrovito multiplier for general irreducible polynomials
From MaRDI portal
Publication:4571363
DOI10.1109/12.859542zbMath1391.94757OpenAlexW2038884834MaRDI QIDQ4571363
A. Halbutoǧulları, Çetin Kaya Koç
Publication date: 9 July 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.859542
Cryptography (94A60) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)
Related Items (4)
Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials ⋮ Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) ⋮ Reduction-free multiplication for finite fields and polynomial rings ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
This page was built for publication: Mastrovito multiplier for general irreducible polynomials