Security analysis of a one-way hash function based on spatiotemporal chaos

The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefore, the original algorithm is insecure and vulnerable. An improved algorithm is pro...

Full description

Saved in:
Bibliographic Details
Published inChinese physics B Vol. 20; no. 9; pp. 79 - 85
Main Author 王世红 单鹏洋
Format Journal Article
LanguageEnglish
Published IOP Publishing 01.09.2011
Subjects
Online AccessGet full text
ISSN1674-1056
2058-3834
DOI10.1088/1674-1056/20/9/090504

Cover

More Information
Summary:The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefore, the original algorithm is insecure and vulnerable. An improved algorithm is proposed to avoid the collisions.
Bibliography:The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefore, the original algorithm is insecure and vulnerable. An improved algorithm is proposed to avoid the collisions.
collision, spatiotemporal chaos, hash function
11-5639/O4
Wang Shi-Hong and Shan Peng-Yang a) School of Science, lgeijing University of Posts and Telecommunications, Beijing 100876, China b) International School, Beijing University of Posts and Telecommunications, Beijing 100876, China
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1674-1056
2058-3834
DOI:10.1088/1674-1056/20/9/090504