The supersingular isogeny path and endomorphism ring problems are equivalent

11/02/2021
by   Benjamin Wesolowski, et al.
0

We prove that the path-finding problem in ℓ-isogeny graphs and the endomorphism ring problem for supersingular elliptic curves are equivalent under reductions of polynomial expected time, assuming the generalised Riemann hypothesis. The presumed hardness of these problems is foundational for isogeny-based cryptography. As an essential tool, we develop a rigorous algorithm for the quaternion analog of the path-finding problem, building upon the heuristic method of Kohel, Lauter, Petit and Tignol. This problem, and its (previously heuristic) resolution, are both a powerful cryptanalytic tool and a building-block for cryptosystems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2023

The supersingular Endomorphism Ring and One Endomorphism problems are equivalent

The supersingular Endomorphism Ring problem is the following: given a su...
research
01/26/2022

Orienteering with one endomorphism

In supersingular isogeny-based cryptography, the path-finding problem re...
research
09/21/2023

The supersingular endomorphism ring problem given one endomorphism

Given a supersingular elliptic curve E and a non-scalar endomorphism α o...
research
06/14/2018

Ramanujan graphs in cryptography

In this paper we study the security of a proposal for Post-Quantum Crypt...
research
08/04/2020

Non-Commutative Ring Learning With Errors From Cyclic Algebras

The Learning with Errors (LWE) problem is the fundamental backbone of mo...
research
04/30/2022

Failing to hash into supersingular isogeny graphs

An important open problem in supersingular isogeny-based cryptography is...

Please sign up or login with your details

Forgot password? Click here to reset