Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (Q510448)
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 6683708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity |
scientific article; zbMATH DE number 6683708 |
Statements
Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (English)
0 references
10 February 2017
0 references
algebraic cryptanalysis
0 references
multiplicative complexity
0 references
lightweight cryptography
0 references
decoding problem
0 references
0 references
0 references
0 references
0.7661444544792175
0 references
0.7564476728439331
0 references
0.751832902431488
0 references
0.744798481464386
0 references
