One-way Hash Functions Based on Iterated Chaotic Systems

摘要：

Constructions of one-way hash functions based on chaotic systems are studied where the compression function is designed with iterated chaotic systems. A general model is presented and two kinds of schemes are introduced according to different post-processing procedure. Based on the general model, we present two examples. Analysis shows that they behave fairly well. The general approach opens a novel way to design one-way hash functions.

作者: Peng Fei Qiu Shui-sheng

作者单位: College of Computer and Communication Hunan University Chang Sha, Hunan Province, PRC College of Electronic and Information South China University of Technology Guang Zhou, Guangdong Pro

会议类型: 国际会议

会议名称: 2007年通信、电路与系统国际会议(2007 International Conference on Communications,Circuits and Systems Proceedings)

会议地点: 日本福冈

会议语种:英文

在线出版日期: 2007-07-11（万方平台首次上网日期，不代表论文的发表时间）