7 citations · 10 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CR2020★ 7 cited
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…
math.NT2020
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…