A new bit-serial multiplier over GF(pm) using irreducible trinomials
From MaRDI portal
Publication:604106
DOI10.1016/J.CAMWA.2009.12.034zbMATH Open1198.94086OpenAlexW2076666996MaRDI QIDQ604106FDOQ604106
Authors: Nam Su Chang, Tae Hyun Kim, Chang Han Kim, Dong-Guk Han, Jong-In Lim 
Publication date: 8 November 2010
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.12.034
Recommendations
- LFSR-based Bit-Serial $GF(2^m)$ Multipliers using Irreducible Trinomials
- scientific article; zbMATH DE number 1878334
- A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m)
- Computational Science and Its Applications – ICCSA 2004
- On bit-serial multiplication and dual bases in GF(2/sup m/)
- A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\)
- scientific article; zbMATH DE number 1980961
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials
- Bit-serial systolic divider and multiplier for finite fields GF(2/sup m/)
Cites Work
- Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient hardware implementation of finite fields with applications to cryptography
- Hardware Acceleration of the Tate Pairing in Characteristic Three
- A Coprocessor for the Final Exponentiation of the η T Pairing in Characteristic Three
- Progress in Cryptology - INDOCRYPT 2003
Cited In (2)
This page was built for publication: A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604106)
