Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity (Q1667453)
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: Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity |
scientific article; zbMATH DE number 6928271
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity |
scientific article; zbMATH DE number 6928271 |
Statements
Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity (English)
0 references
28 August 2018
0 references
multiple differential cryptanalysis
0 references
Chernoff bounds
0 references
Hoeffding bounds
0 references
0 references
0 references
0.89176285
0 references
0.88931096
0 references
0.8875027
0 references
0.88398206
0 references
0.87656254
0 references
0.8705758
0 references
0.8669304
0 references
0.8664061
0 references
0.86318296
0 references
