default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJavad Doliskani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Jeremy Booher
, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to Hash Into Supersingular Isogeny Graphs. Comput. J. 67(8): 2702-2719 (2024)- 2023
- [j11]Andriyan Bilyk, Javad Doliskani, Zhiyong Gong:
Cryptanalysis of three quantum money schemes. Quantum Inf. Process. 22(4): 177 (2023) - [j10]Javad Doliskani:
How to Sample From the Limiting Distribution of a Continuous-Time Quantum Walk. IEEE Trans. Inf. Theory 69(11): 7149-7159 (2023) - 2022
- [c5]Javad Doliskani, Geovandro C. C. F. Pereira, Paulo S. L. M. Barreto:
Faster Cryptographic Hash Function from Supersingular Isogeny Graphs. SAC 2022: 399-415 - [i18]Jeremy Booher, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to hash into supersingular isogeny graphs. CoRR abs/2205.00135 (2022) - [i17]Andriyan Bilyk, Javad Doliskani, Zhiyong Gong:
Cryptanalysis of Three Quantum Money Schemes. CoRR abs/2205.10488 (2022) - [i16]Javad Doliskani:
How to Sample From The Limiting Distribution of a Continuous-Time Quantum Walk. CoRR abs/2209.13028 (2022) - [i15]Jeremy Booher, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to hash into supersingular isogeny graphs. IACR Cryptol. ePrint Arch. 2022: 518 (2022) - [i14]Andriyan Bilyk, Javad Doliskani, Zhiyong Gong:
Cryptanalysis of Three Quantum Money Schemes. IACR Cryptol. ePrint Arch. 2022: 624 (2022) - 2021
- [j9]Geovandro C. C. F. Pereira, Javad Doliskani, David Jao:
x-only point addition formula and faster compressed SIKE. J. Cryptogr. Eng. 11(1): 57-69 (2021) - [j8]Javad Doliskani, Anand Kumar Narayanan, Éric Schost:
Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. J. Symb. Comput. 105: 199-213 (2021) - [i13]Andriy V. Miranskyy, Lei Zhang, Javad Doliskani:
On Testing and Debugging Quantum Software. CoRR abs/2103.09172 (2021) - [i12]Javad Doliskani:
Efficient Quantum Public-Key Encryption From Learning With Errors. CoRR abs/2105.12790 (2021) - 2020
- [c4]Andriy V. Miranskyy, Lei Zhang, Javad Doliskani:
Is your quantum program bug-free? ICSE (NIER) 2020: 29-32 - [i11]Andriy V. Miranskyy, Lei Zhang, Javad Doliskani:
Is Your Quantum Program Bug-Free? CoRR abs/2001.10870 (2020) - [i10]Geovandro C. C. F. Pereira, Javad Doliskani, David Jao:
x-only point addition formula and faster torsion basis generation in compressed SIKE. IACR Cryptol. ePrint Arch. 2020: 431 (2020) - [i9]Javad Doliskani:
Efficient Quantum Public-Key Encryption From Learning With Errors. IACR Cryptol. ePrint Arch. 2020: 1557 (2020)
2010 – 2019
- 2019
- [j7]Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. Math. Comput. 88(317): 1391-1426 (2019) - [j6]Gustavo H. M. Zanon, Marcos A. Simplício Jr., Geovandro C. C. F. Pereira, Javad Doliskani, Paulo S. L. M. Barreto:
Faster Key Compression for Isogeny-Based Cryptosystems. IEEE Trans. Computers 68(5): 688-701 (2019) - 2018
- [j5]Javad Doliskani:
On division polynomial PIT and supersingularity. Appl. Algebra Eng. Commun. Comput. 29(5): 393-407 (2018) - [j4]Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. ACM Commun. Comput. Algebra 52(4): 117-119 (2018) - [j3]Javad Doliskani, Pascal Giorgi, Romain Lebreton, Éric Schost:
Simultaneous Conversions with the Residue Number System Using Linear Algebra. ACM Trans. Math. Softw. 44(3): 27:1-27:21 (2018) - [c3]Gustavo H. M. Zanon, Marcos A. Simplício Jr., Geovandro C. C. F. Pereira, Javad Doliskani, Paulo S. L. M. Barreto:
Faster Isogeny-Based Compressed Key Agreement. PQCrypto 2018: 248-268 - [i8]Javad Doliskani:
On Division Polynomial PIT and Supersingularity. CoRR abs/1801.02664 (2018) - [i7]Javad Doliskani:
Toward an Optimal Quantum Algorithm for Polynomial Factorization over Finite Fields. CoRR abs/1807.09675 (2018) - 2017
- [i6]Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. CoRR abs/1705.01221 (2017) - [i5]Javad Doliskani, Anand Kumar Narayanan, Éric Schost:
Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields. CoRR abs/1712.00669 (2017) - [i4]Gustavo H. M. Zanon, Marcos A. Simplício Jr., Geovandro C. C. F. Pereira, Javad Doliskani, Paulo S. L. M. Barreto:
Faster isogeny-based compressed key agreement. IACR Cryptol. ePrint Arch. 2017: 1143 (2017) - [i3]Javad Doliskani, Geovandro C. C. F. Pereira, Paulo S. L. M. Barreto:
Faster Cryptographic Hash Function From Supersingular Isogeny Graphs. IACR Cryptol. ePrint Arch. 2017: 1202 (2017) - 2015
- [j2]Javad Doliskani, Éric Schost:
Computing in degree 2k-extensions of finite fields of odd characteristic. Des. Codes Cryptogr. 74(3): 559-569 (2015) - 2014
- [j1]Javad Doliskani, Éric Schost:
Taking roots over high extensions of finite fields. Math. Comput. 83(285): 435-446 (2014) - [c2]Luca De Feo, Javad Doliskani, Éric Schost:
Fast arithmetic for the algebraic closure of finite fields. ISSAC 2014: 122-129 - 2013
- [c1]Luca De Feo, Javad Doliskani, Éric Schost:
Fast algorithms for l-adic towers over finite fields. ISSAC 2013: 165-172 - [i2]Luca De Feo, Javad Doliskani, Éric Schost:
Fast algorithms for ell-adic towers over finite fields. CoRR abs/1301.6021 (2013) - 2011
- [i1]Javad Doliskani, Éric Schost:
Taking Roots over High Extensions of Finite Fields. CoRR abs/1110.4350 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
