Quantum Algorithm for Polynomial Root Finding Problem

Quantum computation is a new computing model based on fundamental quantum mechanical principle. Grover´s algorithm finds the solution for a searching problem in the square root time of exhaustive search. Brassard, Hoyer, Tapp´s algorithm counts the number of solutions for a searching problem. Through exploiting the two quantum algorithms, we propose a quantum algorithm for solving a new cryptography problem -- polynomial root finding problem, which could be used to design a cryptosystem. The algorithm will take O(rootM/t) steps for finding one of the t solutions to the problem, where M is the modular of the equation. The success rate of the algorithm is a constant and the cost of the algorithm depends on the calculations of modular exponentiation and the number of iterations.