On Low Complexity Bit Parallel Polynomial Basis Multipliers

DOI10.1007/978-3-540-45238-6_16zbMath1274.11178OpenAlexW1824465360WikidataQ56453870 ScholiaQ56453870MaRDI QIDQ5187954

Arash Reyhani-Masoleh, M. Anwarul Hasan

Publication date: 9 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-45238-6_16

zbMATH Keywords

finite fieldpolynomial basisGalois fieldpentanomialMastrovito multipliertrinomial and equally-spaced polynomial

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07)

This page was built for publication: On Low Complexity Bit Parallel Polynomial Basis Multipliers