ABSTRACT
To ensure the security of a cryptosystem based on the discrete logarithm problem in a finite abelian group G it is necessary that the group order |G| contains a large prime factor. If G is the group of https://www.w3.org/1998/Math/MathML"> F q https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9780138747022/abb99e87-ffb7-4196-a4c4-acb0033e3d6a/content/eq4066.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> -rational points on an abelian variety, the efficient determination of the group order is a non-trivial problem.
