Cryptography: Theory and Practice
Cryptography: Theory and Practice
Related-key cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Mod n Cryptanalysis, with Applications Against RC5P and M6
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Evolutionary computation in computer security and cryptography
New Generation Computing - Evolutionary computation
Cryptanalysis of four-rounded DES using binary particle swarm optimization
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Cryptanalysis of four-rounded DES using binary particleswarm optimization
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Cryptanalysis of two-round DES using genetic algorithms
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Cryptanalysis of four-rounded DES using binary artificial immune system
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
| Hi-index | 0.00 |
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.