Open AccessIntegral distinguishers for Grøstl‐512 and Kupyna‐512 permutation functions
Author(s) -
Li Rongjia,
Jin Chenhui,
Pan Hongchen
Publication year - 2020
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2019.0056
Subject(s) - mathematics , permutation (music) , hash function , division (mathematics) , algorithm , arithmetic , computer science , physics , computer security , acoustics
Grøstl is one of the SHA‐3 finalist hash functions. Kupyna is the new Ukrainian hash standard, which is structurally very similar to Grøstl. The authors investigate the randomness of the two permutations used in Grøstl‐512 and one of the two permutations used in Kupyna‐512, in this study. New integral distinguishers of the three permutations are constructed. First, using an automatic search tool of division property, they find improved integral distinguishers of the permutations in both the forward and backward directions. Then, subspace trails are utilised to extend the length of the backward integral distinguishers by one round. Finally, the forward and backward integral distinguishers are combined using the inside‐out method. As far as they know, they decrease the computational cost of 8, 9 and 10‐round distinguishers and their 12‐round distinguishers are the longest distinguishers for the three permutations.