论文部分内容阅读
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) expe