Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware

DOI10.1023/A:1019715916749zbMath1097.68502OpenAlexW2914281158MaRDI QIDQ1862258

José Luis Imaña

Publication date: 11 March 2003

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019715916749

zbMATH Keywords

polynomialsbasesmultiplicationimplementationFPGAGalois fieldsreconfigurable hardwareextension fields\(\text{GF}(2^m)\)

Mathematics Subject Classification ID

Cryptography (94A60) Finite fields (field-theoretic aspects) (12E20) Mathematical problems of computer architecture (68M07)

This page was built for publication: Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware