Abstract
An algorithm for one-way Hash function construction based on iterating a chaotic map is proposed. The total chaotic space is divided into some subspace based on the density distribution function of the chaotic map. Each subspace is associated with a unique bit in a bit sequence. The value of the chaotic map is dynamically decided by the last-time value and the corresponding message bit in different positions. When the chaotic value is in one subspace, changes the corresponding bit. Finally, the bit sequence is used as the Hash value. Theoretical analysis and computer simulation indicate that the algorithm can resist statistical attack, birthday attack and meet-in-the-middle attack and satisfy all performance requirement of Hash function in an efficient and flexible manner. It is practicable and reliable, with high potential to be adopted for E-commerce.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
