HASH FUNCTION CONSTRUCTION BASED ON THE CHAOTIC LOOK-UP TABLE WITH CHANGEABLE PARAMETER
2011 ◽
Vol 25
(29)
◽
pp. 3835-3851
◽
Keyword(s):
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.
2005 ◽
Vol 24
(1)
◽
pp. 65-71
◽
The suffix-free-prefix-free hash function construction and its indifferentiability security analysis
2012 ◽
Vol 11
(6)
◽
pp. 419-434
◽
2008 ◽
Vol 372
(26)
◽
pp. 4682-4688
◽
2013 ◽
Vol 5
(10)
◽
pp. 288-294
2017 ◽
Vol 17
(6)
◽
pp. 1529-1541
Keyword(s):