On comparison and analysis of algorithms for multiplication in GF(2ᵐ)

DOI10.1006/JCSS.1995.1081zbMATH Open1294.68168OpenAlexW2053479561MaRDI QIDQ960503FDOQ960503

Hichun Eun, Jong-In Lim, Changho Seo

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

Recommendations

• scientific article
• A new algorithm for multiplication in finite fields
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
• Publication:4502774
• GF(2/sup m/) multiplication and division over the dual basis

zbMATH Keywords

VLSIcryptographic algorithmsReed-Solomon encoders

Mathematics Subject Classification ID

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

Cited In (11)

• An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
• Faster Multiplication in GF(2)[x]
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The VLSI Implementation of a Reed—Solomon Encoder Using Berlekamp's Bit-Serial Multiplier Algorithm
• A new algorithm for multiplication in finite fields
• Title not available (Why is that?)
• Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
• Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\)
• On computing multiplicative inverses in GF(2/sup m/)

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

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