7 citations · 10 across the 5 of their papers we have counts for
6 papers
Hidden Stabilizers, the Isogeny To Endomorphism Ring Problem and the Cryptanalysis of pSIDH
Mingjie Chen, Muhammad Imran, Gábor Ivanyos +3
The Isogeny to Endomorphism Ring Problem (IsERP) asks to compute the endomorphism ring of the codomain of an isogeny between supersingular curves in characteristic given only a…
Failing to hash into supersingular isogeny graphs
Jeremy Booher, Ross Bowden, Javad Doliskani +12
An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of "hard supersingular curves" that is, equation…
Stronger bounds on the cost of computing Groebner bases for HFE systems
Elisa Gorla, Daniela Mueller, Christophe Petit
We give upper bounds for the solving degree and the last fall degree of the polynomial system associated to the HFE (Hidden Field Equations) cryptosystem. Our bounds improve the kn…
Improved torsion point attacks on SIDH variants
Victoria de Quehen, Péter Kutas, Chris Leonardi +4
SIDH is a post-quantum key exchange algorithm based on the presumed difficulty of finding isogenies between supersingular elliptic curves. However, SIDH and related cryptosystems a…
New results on quasi-subfield polynomials
M. Euler, C. Petit
Quasi-subfield polynomials were introduced by Huang et al. together with a new algorithm to solve the Elliptic Curve Discrete Logarithm Problem (ECDLP) over finite fields of small…
On the quaternion -isogeny path problem
David Kohel, Kristin Lauter, Christophe Petit +1
Let $\cO$ be a maximal order in a definite quaternion algebra over of prime discriminant , and a small prime. We describe a probabilistic algorithm, which fo…