More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials

DOI10.1016/J.COMPELECENG.2008.09.009zbMath1162.68442OpenAlexW1993470435MaRDI QIDQ1013353

Chang Hoon Kim, Chun Pyo Hong, Soonhak Kwon

Publication date: 17 April 2009

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compeleceng.2008.09.009

zbMATH Keywords

VLSIsystolic arraytrinomialfinite field arithmeticLSB first algorithm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

This page was built for publication: More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials