38 citations · 38 across the 3 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2018
Toward an Optimal Quantum Algorithm for Polynomial Factorization over Finite Fields
Javad Doliskani
We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree over a finite field $\F_q$, the average-case complexity of…
cs.SC2018
On Division Polynomial PIT and Supersingularity
Javad Doliskani
For an elliptic curve over a finite field $\F_q$, where is a prime power, we propose new algorithms for testing the supersingularity of . Our algorithms are based on the…