Computer Science – Cryptography and Security
Scientific paper
2011-12-06
Computer Science
Cryptography and Security
Accepted the the Internet11 conference
Scientific paper
Security of information transmitted through the Internet is an international concern. This security is guaranteed by tools like hash functions. However, as security flaws have been recently identified in the current standard in this domain, new ways to hash digital media must be investigated. In this document an original keyed hash function is evaluated. It is based on chaotic iterations and thus possesses various topological properties as uniform repartition and sensibility to its initial condition. These properties make our hash function satisfy the requirements in this field. This claim is verified qualitatively and experimentally in this research work, among other things by realizing simulations of diffusion and confusion.
Bahi Jacques M.
Couchot Jean-François
Guyeux Christophe
No associations
LandOfFree
Performance Analysis of a Keyed Hash Function based on Discrete and Chaotic Proven Iterations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Performance Analysis of a Keyed Hash Function based on Discrete and Chaotic Proven Iterations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance Analysis of a Keyed Hash Function based on Discrete and Chaotic Proven Iterations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-381104