View in EDS

Failing to Hash Into Supersingular Isogeny Graphs.

Saved in:

Bibliographic Details
Title:	Failing to Hash Into Supersingular Isogeny Graphs.
Authors:	Booher, Jeremy¹, Bowden, Ross², Doliskani, Javad³, Fouotsa, Tako Boris⁴, Galbraith, Steven D⁵, Kunzweiler, Sabrina⁶, Merz, Simon-Philipp⁷, Petit, Christophe^8,9, Smith, Benjamin¹⁰, Stange, Katherine E¹¹ kstange@math.colorado.edu, Ti, Yan Bo¹², Vincent, Christelle¹³, Voloch, José Felipe¹⁴, Weitkämper, Charlotte⁹, Zobernig, Lukas⁵
Source:	Computer Journal. Aug2024, Vol. 67 Issue 8, p2702-2719. 18p.
Subjects:	Cryptography, Hashing, Random walks, Elliptic curves, Polynomials
Abstract:	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 applying Kummer surfaces and (v) using quantum random walks. [ABSTRACT FROM AUTHOR]
	Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	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 applying Kummer surfaces and (v) using quantum random walks. [ABSTRACT FROM AUTHOR]
ISSN:	00104620
DOI:	10.1093/comjnl/bxae038