activity
20082025
most citedComputing the endomorphism ring of an ordinary elliptic curve over a finite field

66 citations · 90 across the 9 of their papers we have counts for

collaborators
Showing 2011Show all

2 papers · 1 filter

math.NT2011★ 6 cited

Computing endomorphism rings of elliptic curves under the GRH

Gaetan Bisson

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size o…

math.NT2011★ 5 cited

A low-memory algorithm for finding short product representations in finite groups

Gaetan Bisson, Andrew V. Sutherland

We describe a space-efficient algorithm for solving a generalization of the subset sum problem in a finite group G, using a Pollard-rho approach. Given an element z and a sequence…