38 citations · 58 across the 9 of their papers we have counts for
12 papers
How to Sample From The Limiting Distribution of a Continuous-Time Quantum Walk
Javad Doliskani
We introduce -projectors, using which we can sample from limiting distributions of continuous-time quantum walks. The standard algorithm for sampling from a distributi…
Cryptanalysis of Three Quantum Money Schemes
Andriyan Bilyk, Javad Doliskani, Zhiyong Gong
We investigate the security assumptions behind three public-key quantum money schemes. Aaronson and Christiano proposed a scheme based on hidden subspaces of the vector space $\mat…
Failing to hash into supersingular isogeny graphs
Jeremy Booher, Ross Bowden, Javad Doliskani +12
An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of "hard supersingular curves" that is, equation…
Efficient Quantum Public-Key Encryption From Learning With Errors
Javad Doliskani
Our main result is a quantum public-key encryption scheme based on the Extrapolated Dihedral Coset problem (EDCP) which is equivalent, under quantum polynomial-time reductions, to…
On Testing and Debugging Quantum Software
Andriy Miranskyy, Lei Zhang, Javad Doliskani
Quantum computers are becoming more mainstream. As more programmers are starting to look at writing quantum programs, they need to test and debug their code. In this paper, we disc…
Is Your Quantum Program Bug-Free?
Andriy Miranskyy, Lei Zhang, Javad Doliskani
Quantum computers are becoming more mainstream. As more programmers are starting to look at writing quantum programs, they face an inevitable task of debugging their code. How shou…
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…
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…
Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields
Javad Doliskani, Anand Kumar Narayanan, Éric Schost
We present a novel randomized algorithm to factor polynomials over a finite field $\F_q$ of odd characteristic using rank Drinfeld modules with complex multiplication. The main…
Computing isomorphisms and embeddings of finite fields
Ludovic Brieulle, Luca De Feo, Javad Doliskani +2
Let be a finite field. Given two irreducible polynomials over , with dividing , the finite field embedding probl…
Fast algorithms for ell-adic towers over finite fields
Luca De Feo, Javad Doliskani, Éric Schost
Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in (the first levels of) the ell-adic closure of a finite field. In m…
Taking Roots over High Extensions of Finite Fields
Javad Doliskani, Eric Schost
We present a new algorithm for computing -th roots over the finite field $\F_q$, where , with a prime, and any positive integer. In the particular case , t…