An optimized design for serial-parallel finite field multiplication over GF(2m) based on all-one polynomials
10.1109/ASPDAC.2009.4796482
Saved in:
Main Authors: | Meher, P.K., Ha, Y., Lee, C.-Y. |
---|---|
Other Authors: | ELECTRICAL & COMPUTER ENGINEERING |
Format: | Conference or Workshop Item |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/83483 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Concurrent error detection in bit-serial normal basis multiplication over GF(2^m) using multiple parity prediction schemes
by: Lee, Chiou Yng, et al.
Published: (2011) -
Permutation polynomials over a finite field
by: Suphawan Janphaisaeng
Published: (2007) -
Constructing irreducible polynomials over finite fields
by: Ling, San, et al.
Published: (2013) -
High-speed and low-power serial accumulator for serial/parallel multiplier
by: Meher, Manas Ranjan, et al.
Published: (2010) -
Iterative sparse matrix vector multiplication (SpMV) over GF(2) with CUDA
by: Prashanth Srinivas G S.
Published: (2011)