Rigorous upper bounds on data complexities of block cipher cryptanalysis (Q1676236)
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 6803050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rigorous upper bounds on data complexities of block cipher cryptanalysis |
scientific article; zbMATH DE number 6803050 |
Statements
Rigorous upper bounds on data complexities of block cipher cryptanalysis (English)
0 references
6 November 2017
0 references
block cipher
0 references
linear cryptanalysis
0 references
differential cryptanalysis
0 references
log-likelihood ratio test
0 references
hypothesis testing
0 references
Chernoff bound
0 references
Hoeffding's inequality
0 references
0 references
0 references
0 references
0.8681412935256958
0 references
0.8563393950462341
0 references
0.8386476039886475
0 references
0.8314643502235413
0 references
