Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic
From MaRDI portal
Publication:1580541
DOI10.1023/A:1008389508626zbMath0976.94019OpenAlexW1595724787MaRDI QIDQ1580541
A. Halbutoǧulları, Çetin Kaya Koç
Publication date: 13 January 2002
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008389508626
cryptographyparallel algorithmfinite field multiplicationtable lookupmultiplication operationpolynomial residue arithmetic
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07)
Related Items (2)
An alternative class of irreducible polynomials for optimal extension fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
This page was built for publication: Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic
