Abstract
We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree n over a finite field Fq, the average-case complexity of our algorithm is an exp...
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
