Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials (Q4589560)
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: Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials |
scientific article; zbMATH DE number 6805698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials |
scientific article; zbMATH DE number 6805698 |
Statements
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials (English)
0 references
10 November 2017
0 references
