Aleksandr Lenin on Mon, 02 Apr 2018 15:36:14 +0200


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Elliptic group generators in PARI library


Hello,

the functions that search for elliptic group generators,
ellgenerators(GEN E) and ellff_get_gens(GEN E), work very slowly in the
case of elliptic curves of cryptographic sizes (i.e., 1600-bit base
field). I think that these functions try to factor the elliptic group
cardinality, which is infeasible. It also seems that these functions do
not accept the factorization matrix of the elliptic group cardinality as
the second argument (in case it is known) to speed up calculations. Is
there any other recommended way to search for elliptic group generators
in elliptic curves over big prime fields?


-- 
With kind regards,
Aleksandr