Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems (Q1745698)
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: Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems |
scientific article; zbMATH DE number 6861248
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems |
scientific article; zbMATH DE number 6861248 |
Statements
Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems (English)
0 references
18 April 2018
0 references
symmetric cryptography
0 references
statistical hypotheses testing
0 references
statistical attack
0 references
block cipher
0 references
stream cipher
0 references
correlation attack
0 references
data complexity
0 references
Fano's inequality
0 references
0 references
0 references
0 references
0.8563393950462341
0 references
0.7902440428733826
0 references
0.789300799369812
0 references
0.7886509895324707
0 references
