A complete permutation over \(\mathrm{GF}(2^{2m})\) with easy hardware implementation and the best known cryptography properties (Q5367654)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6795058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complete permutation over \(\mathrm{GF}(2^{2m})\) with easy hardware implementation and the best known cryptography properties |
scientific article; zbMATH DE number 6795058 |
Statements
20 October 2017
0 references
S-boxes
0 references
differential uniformity
0 references
nonlinearity
0 references
lightweight cryptography
0 references
A Complete Permutation Over GF(2$^{2m}$) With Easy Hardware Implementation and the Best Known Cryptography Properties (English)
0 references
0.8120245933532715
0 references
0.8058406114578247
0 references
0.7978149056434631
0 references
0.7969294190406799
0 references
0.7942494750022888
0 references
