Home // International Journal On Advances in Internet Technology, volume 5, numbers 1 and 2, 2012 // View article

Quality Analysis of a Chaotic Proven Keyed Hash Function

Authors:
Jacques M. Bahi
Jean-François Couchot
Christophe Guyeux

Keywords: Keyed Hash Function; Internet Security; Mathematical Theory of Chaos; Topology

Abstract:
Hash functions are cryptographic tools, which are notably involved in integrity checking and password storage. They are of primary importance to improve the security of exchanges through the Internet. However, as security flaws have been recently identified in the current standard in this domain, new ways to hash digital data must be investigated. In this document an original keyed hash function is evaluated. It is based on asynchronous iterations leading to functions that have been proven to be chaotic. It thus possesses various topological properties as uniformity and sensibility to its initial condition. These properties make our hash function satisfies established security requirements in this field. This claim is qualitatively proven and experimentally verified in this research work, among other things by realizing a large number of simulations.

Pages: 26 to 33

Copyright: Copyright (c) to authors, 2012. Used with permission.

Publication date: June 30, 2012

Published in: journal

ISSN: 1942-2652