Computational Science and Its Applications – ICCSA 2004
From MaRDI portal
Publication:5307201
DOI10.1007/B98051zbMATH Open1127.68337OpenAlexW4300844842MaRDI QIDQ5307201FDOQ5307201
Authors: Wu Woan Kim, Sang-Dong Jang
Publication date: 25 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98051
Recommendations
- An Efficient CRT-Based Bit-Parallel Multiplier for Special Pentanomials
- Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials
- Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)
- Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)
- A practical parallel algorithm for computinga b modc *
- A simplified architecture for module (2/sup n/+1) multiplication
- Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic
- A universal architecture for designing efficient modulo 2/sup n/+1 multipliers
- A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
Cited In (3)
This page was built for publication: Computational Science and Its Applications – ICCSA 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307201)