How to distinguish between a block cipher and a random permutation by lowering the input entropy

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 round...

Full description

Saved in:
Bibliographic Details
Published in:2001 IEEE International Carnahan Conference on Secuity Technology pp. 289 - 292
Main Authors: Hernandez, J.C., Isasi, P., Sierra, J.M., Gonzalez-Tablas, A.
Format: Conference Proceeding
Language:English
Published: IEEE 2001
Subjects:
Artificial intelligence
Computer science
Computer security
Cryptography
Entropy
Genetic algorithms
Performance analysis
Performance evaluation
Testing
ISBN:0780366360, 9780780366367
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:0780366360
9780780366367
DOI:10.1109/CCST.2001.962847