3 papers
cs.CR2023
On homomorphic encryption using abelian groups: Classical security analysis
Eleni Agathocleous, Vishnupriya Anupindi, Annette Bachmayr +3
In [15], Leonardi and Ruiz-Lopez propose an additively homomorphic public key encryption scheme whose security is expected to depend on the hardness of the learning homomorphism wi…
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…
math.NT2017
Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication
Sean Ballentine, Aurore Guillevic, Elisa Lorenzo García +4
Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations…