TY - JOUR
T1 - A secure hash function based on feedback iterative structure
AU - Yang, Yijun
AU - Chen, Fei
AU - Chen, Jianyong
AU - Zhang, Yong
AU - Yung, Kai Leung
N1 - Funding Information:
This work was supported by the Natural Science Foundation of Guangdong Province [2017A030310134]; the National Natural Science Foundation of China [61872243, 61702341, 61836005, 61602316, 61672358, 61502314]; Technology Planning Project from Guangdong Province of China [2014B010118005]; the Science and Technology Plan Projects of Shenzhen [JCYJ20160307115030281, JCYJ20170302145623566, JCYJ20170818140234295]; a grant from the Department of Industrial and Systems Engineering, the Hong?Kong Polytechnic University, China [H-ZG3K].
Funding Information:
This work was supported by the Natural Science Foundation of Guangdong Province [2017A030310134]; the National Natural Science Foundation of China [61872243, 61702341, 61836005, 61602316, 61672358, 61502314]; Technology Planning Project from Guangdong Province of China [2014B010118005]; the Science and Technology Plan Projects of Shenzhen [JCYJ20160307115030281, JCYJ20170302145623566, JCYJ20170818140234295]; a grant from the Department of Industrial and Systems Engineering, the Hong Kong Polytechnic University, China [H-ZG3K].
Publisher Copyright:
© 2019, © 2019 Informa UK Limited, trading as Taylor & Francis Group.
PY - 2019/3/16
Y1 - 2019/3/16
N2 - Rapid growth of internet data has created enormous security challenges on authenticity, availability and integrity protection of these outsourced data. Hash function is one of the main solutions to face these challenges. This paper proposes a feedback iterative structure of hash function which utilises the variable feedback to resist attacks. Furthermore, to accelerate message diffusion, two novel modules are designed, one for iteration and the other for truncation. Experimental results show that the proposed hash function can effectively resist existing attacks. Moreover, comparing with other existing hash functions, it displays better on statistical performance, collision resistance and avalanche.
AB - Rapid growth of internet data has created enormous security challenges on authenticity, availability and integrity protection of these outsourced data. Hash function is one of the main solutions to face these challenges. This paper proposes a feedback iterative structure of hash function which utilises the variable feedback to resist attacks. Furthermore, to accelerate message diffusion, two novel modules are designed, one for iteration and the other for truncation. Experimental results show that the proposed hash function can effectively resist existing attacks. Moreover, comparing with other existing hash functions, it displays better on statistical performance, collision resistance and avalanche.
KW - avalanche
KW - collision resistance
KW - compression function
KW - feedback iterative structure
KW - Hash function
UR - http://www.scopus.com/inward/record.url?scp=85059957797&partnerID=8YFLogxK
U2 - 10.1080/17517575.2018.1564942
DO - 10.1080/17517575.2018.1564942
M3 - Journal article
AN - SCOPUS:85059957797
SN - 1751-7575
VL - 13
SP - 281
EP - 302
JO - Enterprise Information Systems
JF - Enterprise Information Systems
IS - 3
ER -