vix.ing · top · new · best · stats · spec

Performance Analysis of a Keyed Hash Function based on Discrete and\n Chaotic Proven Iterations

2011/12/06 by Jacques M. Bahi, Bahi, Jacques M., Jean-François Couchot +3 · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · Physics and Astronomy · #Cellular Automata and Applications #Chaos control and synchronization #Chaos-based Image/Signal Encryption #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Fractal and DNA sequence analysis

paper · pdf · doi:10.48550/arxiv.1112.1271

openalex publication_date 2011/12/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Security of information transmitted through the Internet is an international\nconcern. This security is guaranteed by tools like hash functions. However, as\nsecurity flaws have been recently identified in the current standard in this\ndomain, new ways to hash digital media must be investigated. In this document\nan original keyed hash function is evaluated. It is based on chaotic iterations\nand thus possesses various topological properties as uniform repartition and\nsensibility to its initial condition. These properties make our hash function\nsatisfy the requirements in this field. This claim is verified qualitatively\nand experimentally in this research work, among other things by realizing\nsimulations of diffusion and confusion.\n

Cited by

Related