Paper 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.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. preprint
Keywords
curve cryptography
Contact author(s)
weng @ mathematik uni-mainz de
History
2004-11-03: received
Short URL
https://ia.cr/2004/285
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2004/285,
      author = {Annegret Weng},
      title = {Generation of random Picard curves for cryptography},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/285},
      year = {2004},
      url = {https://eprint.iacr.org/2004/285}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.