How Much Can Complexity of Linear Cryptanalysis Be Reduced? (Q2942831)
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 6481212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How Much Can Complexity of Linear Cryptanalysis Be Reduced? |
scientific article; zbMATH DE number 6481212 |
Statements
How Much Can Complexity of Linear Cryptanalysis Be Reduced? (English)
0 references
11 September 2015
0 references
linear cryptanalysis
0 references
FFT
0 references
multiple linear cryptanalysis
0 references
FEAL-8X
0 references
0 references
0 references
0.88069487
0 references
0 references
0.8393574
0 references
0.8296293
0 references
0 references
0 references
0.81909466
0 references
0.8143177
0 references
