On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\) (Q960503)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On comparison and analysis of algorithms for multiplication in GF(2ᵐ) |
scientific article; zbMATH DE number 5476967
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\) |
scientific article; zbMATH DE number 5476967 |
Statements
On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\) (English)
0 references
21 December 2008
0 references
VLSI
0 references
Reed-Solomon encoders
0 references
cryptographic algorithms
0 references
