On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\)

DOI10.1006/JCSS.1995.1081zbMath1294.68168OpenAlexW2053479561MaRDI QIDQ960503

Hichun Eun, Changho Seo, Jong In Lim

Publication date: 21 December 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1995.1081

zbMATH Keywords

VLSIcryptographic algorithmsReed-Solomon encoders

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Decoding (94B35)

This page was built for publication: On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\)