By Topic

The Design Problems of One Kind of Chaotic One-Way Hash Function

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Peiyue Li ; State Key Lab. of Appl. Opt., Changchun Inst. of Opt., Fine Mech. & Phys., Changchun, China ; Mingchao Zhang ; Junxia Shi

The construction method of one kind of one-way hash function based on 1-D Logistic map is analyzed. The design problem and some collision problems are pointed out. By using the dictionary attack, the collision probability of the arithmetic realized with signal floating point numbers is 2-23, and the collision probability of the arithmetic realized with double floating point numbers is 2-55. The reasons for these design problems are discussed, and some key problems are pointed out which should be taken care of while constructing one-way hash function based on a digital chaotic map.

Published in:

2012 Fourth International Conference on Multimedia Information Networking and Security

Date of Conference:

2-4 Nov. 2012