Efficient bit-parallel multipliers over finite fields GF\((2^m)\)

DOI10.1016/J.COMPELECENG.2010.01.001zbMath1215.68278OpenAlexW1969425915MaRDI QIDQ605724

Chiou-Yng Lee, Pramod Kumar Meher

Publication date: 25 November 2010

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compeleceng.2010.01.001

zbMATH Keywords

permutation polynomialtrinomialcomposite fieldlike-polynomiallike-trinomialpentanomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Related Items (1)

A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Efficient bit-parallel multipliers over finite fields GF\((2^m)\)