Javad Doliskani

Javad Doliskani

Auto-generated profile, based on publicly available information

Javad Doliskani

Department of Computer Science Ryerson University Toronto Canada

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2018
Verified
Book Chapter
Closed access
PDF file
GZGustavo H. M. Zanon
Gustavo H. M. Zanon
MSMarcos A. Simplicio
Marcos A. Simplicio
GPGeovandro C. C. F. Pereira
Geovandro C. C. F. Pereira
JDJavad Doliskani
Javad Doliskani
PBPaulo S. L. M. Barreto
Paulo S. L. M. Barreto

25 November 2020 in Journal of Cryptographic Engineering
Verified
Journal Article
Closed access
PDF file
GPGeovandro Pereira
Geovandro Pereira
JDJavad Doliskani
Javad Doliskani
DJDavid Jao
David Jao

19 April 2023 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
ABAndriyan Bilyk
Andriyan Bilyk
JDJavad Doliskani
Javad Doliskani
ZGZhiyong Gong
Zhiyong Gong

12 May 2024
Verified
Book Chapter
Closed access
PDF file
JDJavad Doliskani
Javad Doliskani
GPGeovandro C. C. F. Pereira
Geovandro C. C. F. Pereira
PBPaulo S. L. M. Barreto
Paulo S. L. M. Barreto

22 June 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JDJavad Doliskani
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 distribution that is close to the limiting distribution of a given quantum walk is to run the quantum walk for a time chosen uniformly at random from a large interval, and measure the resulting quantum state. This approach usually results in an exponential running time. We show that, using ε-projectors, we can sample exactly from the limiting distribution. In the black-box setting, where we only have query access to the adjacency matrix of the graph, our sampling algorithm runs in time proportional to Δ -1 , where Δ is the minimum spacing between the distinct eigenvalues of the graph. In the non-black-box setting, we give examples of graphs for which our algorithm runs exponentially faster than the standard sampling algorithm.

19 October 2022 in arXiv
Verified
Preprint
Open access
PDF file
JBJeremy Booher
Jeremy Booher
RBRoss Bowden
Ross Bowden
JDJavad Doliskani
Javad Doliskani
TFTako Boris Fouotsa
Tako Boris Fouotsa
SGSteven D. Galbraith
Steven D. Galbraith
LZLukas Zobernig
Lukas Zobernig
An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of "hard supersingular curves" that is, equations for supersingular curves for which computing the endomorphism ring is as difficult as it is for random supersingular curves. A related open problem is to produce a hash function to the vertices of the supersingular $\ell$-isogeny graph which does not reveal the endomorphism ring, or a path to a curve of known endomorphism ring. Such a hash function would open up interesting cryptographic applications. In this paper, we document a number of (thus far) failed attempts to solve this problem, in the hope that we may spur further research, and shed light on the challenges and obstacles to this endeavour. The mathematical approaches contained in this article include: (i) iterative root-finding for the supersingular polynomial; (ii) gcd's of specialized modular polynomials; (iii) using division polynomials to create small systems of equations; (iv) taking random walks in the isogeny graph of abelian surfaces; and (v) using quantum random walks.