Low complexity bit-parallel multiplier for defined by repeated polynomials☆
Under an Elsevier user license
open archive
Keywords
Finite field
Irreducible polynomial
Polynomial basis
Multiplication
Cited by (0)
- ☆
This research was supported by Next-Generation Information Computing Development Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (No. NRF-2014M3C4A7030649).
© 2016 Elsevier B.V.