Second Preimage Attack on a Chaos-Based Hash Function Construction and Its Improvement

2012 ◽  
pp. 131-140
Author(s):  
Zahra Hajibabaei ◽  
Mohammad Dakhilalian
2005 ◽  
Vol 54 (10) ◽  
pp. 4562
Author(s):  
Peng Fei ◽  
Qiu Shui-Sheng ◽  
Long Min

Author(s):  
Shuang Wu ◽  
Dengguo Feng ◽  
Wenling Wu ◽  
Jian Guo ◽  
Le Dong ◽  
...  

2012 ◽  
Vol 11 (6) ◽  
pp. 419-434 ◽  
Author(s):  
Nasour Bagheri ◽  
Praveen Gauravaram ◽  
Lars R. Knudsen ◽  
Erik Zenner

2008 ◽  
Vol 372 (26) ◽  
pp. 4682-4688 ◽  
Author(s):  
Di Xiao ◽  
Xiaofeng Liao ◽  
Shaojiang Deng

2011 ◽  
Vol 25 (29) ◽  
pp. 3835-3851 ◽  
Author(s):  
YANTAO LI ◽  
DI XIAO ◽  
SHAOJIANG DENG

In this paper, we propose an algorithm for one-way hash function construction based on the chaotic look-up table with changeable parameter. First, the original message with padding is divided into block messages as groups and then further broken into sub-block messages, which are translated into corresponding ASCII codes by groups. Then the group ASCII codes are successively inputted into the chaotic look-up table updated by changeable parameter to permute corresponding values. Finally, based on the calculation of the values, 128-bit hash value is generated. Performance analysis indicates that our proposed algorithm satisfies sensitive requirements and can resist all kinds of attacks.


Author(s):  
Florian Mendel ◽  
Norbert Pramstaller ◽  
Christian Rechberger

2006 ◽  
Vol 55 (9) ◽  
pp. 4442
Author(s):  
Guo Xian-Feng ◽  
Zhang Jia-Shu

Sign in / Sign up

Export Citation Format

Share Document