In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on grover's quantum searchalgorithm and birthday attack is proposed. In thisalgorithm, finding a collision for arbitrary...
详细信息
In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on grover's quantum searchalgorithm and birthday attack is proposed. In thisalgorithm, 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.
暂无评论