Scalable and Systolic Gaussian Normal Basis Multipliers over GF(2m) Using Hankel Matrix-Vector Representation
None
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Capítulo de libro |
| Lenguaje: | inglés |
| Publicado: |
IntechOpen
2010
|
| Materias: | |
| Acceso en línea: | https://www.intechopen.com/chapters/9448 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares: Scalable and Systolic Gaussian Normal Basis Multipliers over GF(2m) Using Hankel Matrix-Vector Representation
- Efficient Hardware Implementation of Modular Multiplier over GF (2m) on FPGA
- Efficient Fault Detection Architecture of Bit-Parallel Multiplier in Polynomial Basis of GF(2m) Using BCH Code
- High-Speed Area-Efficient Hardware Architecture for the Efficient Detection of Faults in a Bit-Parallel Multiplier Utilizing the Polynomial Basis of GF(2m)
- BCH codes over $\gf(q)$ with length $q^m+1$
- An improved upper bound on self-dual codes over finite fields $GF(11), GF(19)$, and $GF(23)$
- Area- Efficient VLSI Implementation of Serial-In Parallel-Out Multiplier Using Polynomial Representation in Finite Field GF(2m)