Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields

DOI10.1109/18.45274zbMath0694.94024OpenAlexW2078420256MaRDI QIDQ3470429

Masakatu Morii, Douglas L. Whiting, Masao Kasahara

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1109/18.45274

zbMATH Keywords

finite fieldsbit-serial multiplicationDiscrete time Wiener-Hopf equations

Mathematics Subject Classification ID

Circuits, networks (94C99) Communication, information (94A99) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (3)

Efficient hardware implementation of finite fields with applications to cryptography ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Self-dual bases in \(\mathbb{F}_{q^ n}\)

This page was built for publication: Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields