[Resource Topic] 2004/285: Generation of random Picard curves for cryptography

Welcome to the resource topic for 2004/285

Generation of random Picard curves for cryptography

Authors: Annegret Weng


Based on ideas in an earlier paper by Mark Bauer, Edlyn Teske and myself and ideas of Pierrick Gaudry and Eric Schost, we present an algorithm for counting the number of elements in the Jacobian of a random Picard curve over a finite prime field of cryptosize. We give two examples of curves with a Jacobian of prime group order.

ePrint: https://eprint.iacr.org/2004/285

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .