On non-polynomiality of XOR over \(\mathbb Z_2^n\) (Q3369010)
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 non-polynomiality of XOR over Z₂^n |
scientific article; zbMATH DE number 5005285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On non-polynomiality of XOR over \(\mathbb Z_2^n\) |
scientific article; zbMATH DE number 5005285 |
Statements
22 March 2007
0 references
Latin squares
0 references
polynomial approximation of XOR
0 references
block ciphers
0 references
block cipher algorithms
0 references
0.824462354183197
0 references
0.8153471946716309
0 references
0.7521726489067078
0 references
0.7333179712295532
0 references
