CryptoDB
Generation of random Picard curves for cryptography
Authors: | |
---|---|
Download: | |
Abstract: | 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. |
BibTeX
@misc{eprint-2004-12251, title={Generation of random Picard curves for cryptography}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / curve cryptography}, url={http://eprint.iacr.org/2004/285}, note={preprint weng@mathematik.uni-mainz.de 12724 received 2 Nov 2004}, author={Annegret Weng}, year=2004 }