Publication: How to distinguish between a block cipher and a random permutation by lowering the input entropy
Loading...
Advisors
Tutors
Editor
Publication date
Defense date
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Serie/Núm
Creative Commons license
To cite this item, use the following identifier: https://hdl.handle.net/10016/4055
Abstract
A novel cryptanalysis technique is presented, and its suitability for distinguishing a block cipher algorithm or a hash function from a random permutation is explained. Additionally, we propose a genetic algorithm based implementation and show some preliminary results of these ideas on reduced rounds versions of the block cipher TEA.
Note
IEEE 35th International Carnahan Conference on Security Technology. Londres, 16-19 October 2001
Keywords
ODS
Funder
Research project
Bibliographic citation
35th International Carnahan Conference on Security Technology, 2001. p. 289-292
DOI: 10.1109/.2001.962847