1 citations · 1 across the 1 of their papers we have counts for
Showing cs.CRShow all
3 papers · 1 filter
cs.CR2025
Unconditional foundations for supersingular isogeny-based cryptography
Arthur Herlédan Le Merdy, Benjamin Wesolowski
In this paper, we prove that the supersingular isogeny problem (Isogeny), endomorphism ring problem (EndRing) and maximal order problem (MaxOrder) are equivalent under probabilisti…
cs.CR2023★ 1 cited
The supersingular Endomorphism Ring and One Endomorphism problems are equivalent
Aurel Page, Benjamin Wesolowski
The supersingular Endomorphism Ring problem is the following: given a supersingular elliptic curve, compute all of its endomorphisms. The presumed hardness of this problem is found…
cs.CR2023
The supersingular endomorphism ring problem given one endomorphism
Arthur Herlédan Le Merdy, Benjamin Wesolowski
Given a supersingular elliptic curve E and a non-scalar endomorphism of E, we prove that the endomorphism ring of E can be computed in classical time about disc(Z[])^1/4 , a…