A Chinese Remainder Theorem Approach to Bit-Parallel <inline-formula><tex-math>$GF(2^{n})$</tex-math> <alternatives><inline-graphic xlink:type="simple" xlink:href="fan-ieq1-2428704.gif"/></alternatives></inline-formula> Polynomial Basis Multipliers for Irreducible Trinomials (Q2985605)
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: A Chinese Remainder Theorem Approach to Bit-Parallel <inline-formula><tex-math>GF(2ⁿ)</tex-math> <alternatives><inline-graphic xlink:type="simple" xlink:href="fan-ieq1-2428704.gif"/></alternatives></inline-formu |
scientific article; zbMATH DE number 6716185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Chinese Remainder Theorem Approach to Bit-Parallel <inline-formula><tex-math>$GF(2^{n})$</tex-math> <alternatives><inline-graphic xlink:type="simple" xlink:href="fan-ieq1-2428704.gif"/></alternatives></inline-formula> Polynomial Basis Multipliers for Irreducible Trinomials |
scientific article; zbMATH DE number 6716185 |
Statements
A Chinese Remainder Theorem Approach to Bit-Parallel <inline-formula><tex-math>$GF(2^{n})$</tex-math> <alternatives><inline-graphic xlink:type="simple" xlink:href="fan-ieq1-2428704.gif"/></alternatives></inline-formula> Polynomial Basis Multipliers for Irreducible Trinomials (English)
0 references
16 May 2017
0 references
