DocumentCode
412741
Title
Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA
Author
Hernandez, Julio Cesar ; Isasi, Pedro
Author_Institution
Comput. Security Group, Carlos III Univ., Madrid, Spain
Volume
3
fYear
2003
fDate
8-12 Dec. 2003
Firstpage
2189
Abstract
A simple way of creating new and efficient distinguishers for cryptographic primitives such as block ciphers or hash functions is introduced. This technique is then successfully applied over reduced round versions of the block cipher TEA, which is proven to be weak with less than five rounds.
Keywords
block codes; cryptography; block cipher TEA; cryptographic mappings; cryptographic primitives; hash functions; tiny encryption algorithm; Application software; Artificial intelligence; Computer security; Cryptography; Data security; Genetic algorithms; Laboratories; Performance evaluation; Probability distribution; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN
0-7803-7804-0
Type
conf
DOI
10.1109/CEC.2003.1299943
Filename
1299943
Link To Document