Bit-parallel finite field multiplier and squarer using polynomial basis

DOI10.1109/TC.2002.1017695zbMath1391.94814OpenAlexW2111459803MaRDI QIDQ4571282

Huapeng Wu

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/tc.2002.1017695

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (11)

Polynomial basis multiplication over \(\text{GF}(2^m)\) ⋮ 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 ⋮ Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\) ⋮ An extension of TYT inversion algorithm in polynomial basis ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Efficient systolic multiplications in composite fields for cryptographic systems ⋮ High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\) ⋮ A three-term Karatsuba multiplier for a special class of trinomials ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity

This page was built for publication: Bit-parallel finite field multiplier and squarer using polynomial basis