Automated Design of Cryptographic Hash Schemes by Evolving Highly-Nonlinear Functions

Hernandez-Castro, Julio C. and Estevez Tapiador, Juan and Peris-Lopez, Pedro and Ribagorda, Arturo (2008) Automated Design of Cryptographic Hash Schemes by Evolving Highly-Nonlinear Functions. Journal of Information Science and Engineering, 24 (5). pp. 1485-1504. ISSN 1530-9827. (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Restricted to Repository staff only
Contact us about this Publication Download (4MB)


In the last years, a number of serious flaws and vulnerabilities have been found in classic cryptographic hash functions such as MD4 and MD5. More recently, similar attacks have been extended to the widely used SHA-1, to such an extent that nowadays is prudent to switch to schemes such as SHA-256 and Whirlpool. Nevertheless, many cryptographers believe that all the SHA-related schemes could be vulnerable to variants of the same attacks, for all these schemes have been largely influenced by the design of the MD4 hash function. In this paper, we present a general framework for the automated design of cryptographic block ciphers and hash functions by using Genetic Programming. After a characterization of the search space and the fitness function, we evolve highlys nonlinear and extremely efficient functions that can be used as the core components of a cryptographic construction. As an example, a new block cipher named Wheedham is proposed. Following the Miyaguchi-Preneel construction, this block cipher is then used as the compression function of a new hash scheme producing digests of 512 bits. We present a security analysis of our proposal and a comparison in terms of performance with the most promising alternatives in the near future: SHA-512 and Whirlpool. The results show that automatically-obtained schemes such as those presented are competitive both in security and speed.

Item Type: Article
Uncontrolled keywords: Block cipher; Cryptography and coding; Evolutionary computation; Hash function; Information security; Non-linear functions
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Divisions: Faculties > Sciences > School of Computing > Security Group
Depositing User: Julio Hernandez-Castro
Date Deposited: 24 Oct 2012 13:38 UTC
Last Modified: 18 Mar 2013 16:12 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year