A redundant representation of GF(qⁿ) for designing arithmetic circuits

DOI10.1109/TC.2003.1214334zbMath1192.11081MaRDI QIDQ3417027

Rainer Steinwandt, Willi Geiselmann

Publication date: 9 January 2007

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

zbMATH Keywords

VLSI implementation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Analytic circuit theory (94C05)

Related Items (2)

Efficient hardware implementation of finite fields with applications to cryptography ⋮ GF(2ⁿ) Redundant Representation Using Matrix Embedding for Irreducible Trinomials

This page was built for publication: A redundant representation of GF(qⁿ) for designing arithmetic circuits