摘要
In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary hash function only needs O(2m/3) expected evaluations, where m is the size of hash space value. It is proved that the algorithm can obviously improve the attack efficiency for only needing O(2 74.7) expected evaluations, and this is more efficient than any known classical algorithm, and the consumed space of the algorithm equals the evaluation.
In order to improve the attack efficiency of the New FORK-256 function,an algorithm based on Grover＇s quantum search algorithm and birthday attack is proposed.In this algorithm,finding a collision for arbitrary hash function only needs O（2m/3） expected evaluations,where m is the size of hash space value.It is proved that the algorithm can obviously improve the attack efficiency for only needing O（274.7） expected evaluations,and this is more efficient than any known classical algorithm,and the consumed space of the algorithm equals the evaluation.
基金
Supported by the National High Technology Research and Development Program(No.2011AA010803)
the National Natural Science Foundation of China(No.U1204602)
