A new algorithm for multiplication in finite fields

DOI10.1109/12.30855zbMath0693.12015OpenAlexW2069706567MaRDI QIDQ3035407

Antonio Pincin

Publication date: 1989

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

Full work available at URL: http://hdl.handle.net/1721.1/3025

zbMATH Keywords

normal basismultiplication algorithmmultiplications in finite fields

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arithmetic theory of polynomial rings over finite fields (11T55) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (3)

Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ Computational problems in the theory of finite fields ⋮ Efficient systolic multiplications in composite fields for cryptographic systems

This page was built for publication: A new algorithm for multiplication in finite fields