Dual bases and bit-serial multiplication in \(\mathbb F_q^n\).

DOI10.1016/S0304-3975(99)00065-1zbMath1098.94608MaRDI QIDQ1575849

Dieter Gollmann

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

dual basestrace functionlinear feedback shift registersBerlekamp's multiplierbit-serial multiplicationFibonacci LFSRGalois LSFRMassey-Omura multiplier

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Mathematical problems of computer architecture (68M07) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (1)

A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Dual bases and bit-serial multiplication in \(\mathbb F_q^n\).