Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials
From MaRDI portal
Publication:4571336
DOI10.1109/12.936239zbMath1396.65178OpenAlexW2122152825MaRDI QIDQ4571336
Publication date: 9 July 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fda3f3c1e04c09f9acc87736d4a68b4fe440e4ce
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Parallel numerical computation (65Y05) Numerical algorithms for computer arithmetic, etc. (65Y04)
Related Items (5)
Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials ⋮ Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks ⋮ A Swan-like note for a family of binary pentanomials ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ A three-term Karatsuba multiplier for a special class of trinomials
This page was built for publication: Systematic design of original and modified Mastrovito multipliers for general irreducible polynomials
