Cryptology ePrint Archive: Report 2004/285

Generation of random Picard curves for cryptography

Annegret Weng

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.

Category / Keywords: public-key cryptography / curve cryptography

Publication Info: preprint

Date: received 2 Nov 2004

Contact author: weng at mathematik uni-mainz de

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20041103:075152 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]