Español English Contacte con nosotros http://www.uc3m.es/portal/page/portal/biblioteca
DSpace e-Archivo

Archivo Abierto Institucional de la Universidad Carlos III de Madrid > Investigación > Departamentos > Departamento de Informática > Grupo de Computación Evolutiva y Redes Neuronales (EVANNAI) > DI - GCERN - Comunicaciones en Congresos y otros eventos >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10016/4055

Files in This Item:
how-to-distinguish_CCST_2001.pdf307,19 kBAdobe PDFformato pdf
Title: How to distinguish between a block cipher and a random permutation by lowering the input entropy
Author(s): Hernández, Julio C.
Isasi, Pedro
Sierra, José M.
González-Tablas, Ana Isabel
Publisher: IEEE
Issued date: Oct-2001
Citation: 35th International Carnahan Conference on Security Technology, 2001. p. 289-292
URI: http://hdl.handle.net/10016/4055
ISBN: 0-7803-6636-0
DOI: http://dx.doi.org/10.1109/.2001.962847
Description: IEEE 35th International Carnahan Conference on Security Technology. Londres, 16-19 October 2001
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.
Publisher version: http://dx.doi.org/10.1109/.2001.962847
Rights: © IEEE
Appears in Collections:DI - GCERN - Capítulos de Monografías
DI - GCERN - Comunicaciones en Congresos y otros eventos

Refworks Export

SFX Query

Items in E-Archivo are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! © Universidad Carlos III de Madrid - Software DSpace - Terms of use - Feedback