arrow
Return

A chaos-based hash function with both modification detection and localization capabilities

delete2010-09-01
delete61
PRE
AI
肖迪 (Di Xiao) *
F
Frank Y. Shih
廖晓峰 (Xiaofeng Liao)
DOI:10.1016/j.cnsns.2009.10.012delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Recently, a variety of chaos-based hash functions have been proposed. Nevertheless, none of them can realize modification localization. In this paper, a hash function with both modification detection and localization capabilities is proposed, which can also support the parallel processing mode. By using the mechanism of changeable-parameter and self-synchronization, the keystream can establish a close relation with the algorithm key, the content, and the order of each message unit. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash functions. (C) 2009 Elsevier B.V. All rights reserved.
Keywords:
Hash function
Chaos
Modification detection and localization
Parallel
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Communications in Nonlinear Science and Numerical Simulation cover
Communications in Nonlinear Science and Numerical Simulation
IF:
3.8
Papers:
9.1K
Citations:
1.8W

Organization

C
Chongqing University
Scholars:
5.1W
Papers: 4.1W
Citations: 6.0W
N
New Jersey Institute of Technology
Scholars:
4.1K
Papers: 4.5K
Citations: 4.6K