A finite field arithmetic unit VLSI chip

DOI10.1007/3-540-57936-2_31MaRDI QIDQ4382308zbMATH OpenFDO

Authors Germain Drolet

Publication date 8 January 1999

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

Full work available at URL https://doi.org/10.1007/3-540-57936-2_31

zbMATH Keywords

Reed-Solomon codesVLSI chip

Mathematics Subject Classification ID

Finite fields and commutative rings (number-theoretic aspects) (11T99) Mathematical problems of computer architecture (68M07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
• scientific article; zbMATH DE number 4102996
• Complexity of computation in finite fields
• scientific article; zbMATH DE number 3861057
• New systolic arrays for C+AB/sup 2/, inversion, and division in GF(2/sup m/)

Cited in

(3)

• Binary fields on limited systems
• scientific article; zbMATH DE number 1526199 (Why is no real title available?)
• Hardware implementation of finite-field division

This page was built for publication: A finite field arithmetic unit VLSI chip

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382308)