Javad Doliskani

Orcid: 0000-0003-4097-9973

According to our database1, Javad Doliskani authored at least 21 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
How to Sample From the Limiting Distribution of a Continuous-Time Quantum Walk.
IEEE Trans. Inf. Theory, November, 2023

2022
Failing to hash into supersingular isogeny graphs.
IACR Cryptol. ePrint Arch., 2022

Cryptanalysis of Three Quantum Money Schemes.
IACR Cryptol. ePrint Arch., 2022

2021
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields.
J. Symb. Comput., 2021

x-only point addition formula and faster compressed SIKE.
J. Cryptogr. Eng., 2021

On Testing and Debugging Quantum Software.
CoRR, 2021

2020
x-only point addition formula and faster torsion basis generation in compressed SIKE.
IACR Cryptol. ePrint Arch., 2020

Efficient Quantum Public-Key Encryption From Learning With Errors.
IACR Cryptol. ePrint Arch., 2020

Is your quantum program bug-free?
Proceedings of the ICSE-NIER 2020: 42nd International Conference on Software Engineering, New Ideas and Emerging Results, Seoul, South Korea, 27 June, 2020

2019
Faster Key Compression for Isogeny-Based Cryptosystems.
IEEE Trans. Computers, 2019

2018
Simultaneous Conversions with the Residue Number System Using Linear Algebra.
ACM Trans. Math. Softw., 2018

Toward an Optimal Quantum Algorithm for Polynomial Factorization over Finite Fields.
CoRR, 2018

Computing isomorphisms and embeddings of finite fields.
ACM Commun. Comput. Algebra, 2018

On division polynomial PIT and supersingularity.
Appl. Algebra Eng. Commun. Comput., 2018

2017
Faster isogeny-based compressed key agreement.
IACR Cryptol. ePrint Arch., 2017

Faster Cryptographic Hash Function From Supersingular Isogeny Graphs.
IACR Cryptol. ePrint Arch., 2017

2015
Computing in degree 2<sup>k</sup>-extensions of finite fields of odd characteristic.
Des. Codes Cryptogr., 2015

2014
Taking roots over high extensions of finite fields.
Math. Comput., 2014

Fast arithmetic for the algebraic closure of finite fields.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013
Fast algorithms for ell-adic towers over finite fields
CoRR, 2013

Fast algorithms for <i>l</i>-adic towers over finite fields.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013


  Loading...