Mastrovito multiplier for all trinomials

DOI10.1109/12.769434zbMath1231.68043OpenAlexW2138169871MaRDI QIDQ3417023

Berk Sunar, Çetin Kaya Koç

Publication date: 9 January 2007

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bcb2215b71c7143ee047dd7364640b8d3bb80c47

zbMATH Keywords

time complexityirreducible trinomialmultiplication in finite fieldsMastrovito multiplier

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Related Items (10)

Polynomial basis multiplication over \(\text{GF}(2^m)\) ⋮ On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime ⋮ Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials ⋮ Reduction-free multiplication for finite fields and polynomial rings ⋮ Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials ⋮ Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm ⋮ Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials ⋮ An extension of TYT inversion algorithm in polynomial basis ⋮ 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: Mastrovito multiplier for all trinomials