Name
Abstract | ||
|---|---|---|
Distinguishing the output of a cryptographic primitive such as a block cipher or a habh function from the output of a random mapping seriously affects the credibility of the primitive security, and defeats it for many cryptographic applications. However, this is usually a quite difficult task. In a previous work [1], a new cryptoanalytic technique was presented and proved useful in distinguishing a block cipher from a random permutation in a completely automatic way. This technique is based in the selection of the worst input patterns for the block cipher with the aid of genetic algorithms. The objective is to find which input patters generate a significant deviation of the observed output from the output we would expect from a random permutation. In [1], this technique was applied to the case of the block cipher TEA with 1 round. The much harder problem of breaking TEA with 2 rounds is successfully solved in this paper, where an efficient distinguisher ia also presented. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-47789-6_108 | International Conference on Computational Science (3) |
Keywords | Field | DocType |
hash function,genetic algorithm,block cipher,random permutation,genetics | Transposition cipher,Substitution-permutation network,Computer science,CBC-MAC,Arithmetic,Algorithm,Running key cipher,Stream cipher,Pseudorandom permutation,Residual block termination,Distributed computing,MDC-2 | Conference |
Volume | ISSN | ISBN |
2331 | 0302-9743 | 3-540-43594-8 |
Citations | PageRank | References |
7 | 0.63 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julio César Hernández Castro | 1 | 189 | 37.03 |
| José María Sierra | 2 | 31 | 6.43 |
| Pedro Isasi | 3 | 370 | 42.14 |
| Arturo Ribagorda | 4 | 669 | 50.25 |