Name
Abstract | ||
|---|---|---|
In this work, we show that heuristic techniques (particularly Simulated Annealing) can be successfully applied in the search of good non-linear approximations of cryptographic primitives. We also provide some experimental results, including two excellent non-linear approximations for the output of the Salsa20 stream cipher with 2 and 4 rounds. From these two approximations, very efficient distinguishers for Salsa20 could easily be obtained, leading to a much more practical attack that any other published so far against this cipher. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/CEC.2007.4424934 | 2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS |
Keywords | Field | DocType |
linear cryptanalysis,approximation theory,stream cipher,cryptography,block cipher,heuristic search,simulated annealing | Simulated annealing,Salsa20,Cipher,Heuristic,Mathematical optimization,Block cipher,Computer science,Cryptography,Cryptographic primitive,Stream cipher | Conference |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juan M. Estévez-tapiador | 1 | 91 | 10.43 |
| Julio César Hernández Castro | 2 | 189 | 37.03 |
| John A. Clark | 3 | 926 | 68.87 |