Open AccessThe collision of one keyed Hash function based on chaotic map and analysis
Author(s) -
Jizhi Wang,
Meiqin Wang,
Yinglong Wang
Publication year - 2008
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.57.2737
Subject(s) - chaotic , hash function , sequence (biology) , collision , computer science , function (biology) , chaotic map , collision attack , rolling hash , algorithm , collision resistance , perfect hash function , mathematics , cryptographic hash function , double hashing , artificial intelligence , genetics , computer security , evolutionary biology , biology
The collision of a keyed hash function based on chaotic map is pointed out. Its principle is analyzed in theory. The definition of the nonsingularity is presented based on analyzing digital discrete chaotic sequence. The necessary and sufficient conditions for the nonsingularity is deduced. The period of digital discrete chaotic sequence with variable parameter is discussed. The result shows that the singulartiy of chaotic sequence leads to the collision of the hash function. So the digital method of chaotic map must be chosen carefully to ensure the nonsingularity of chaotic sequence.