Discrete logarithms in curves over finite fields - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Discrete logarithms in curves over finite fields

Andreas Enge
Algorithmic number theory for cryptology

Abstract

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

Domains

Cryptography and Security [cs.CR] Algebraic Geometry [math.AG] Discrete Mathematics [cs.DM]
Fichier principal
Vignette du fichier
log-survey.pdf (386.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Andreas Enge  : Connect in order to contact the contributor

https://inria.hal.science/inria-00201090

Submitted on : Sunday, December 23, 2007-1:32:24 PM

Last modification on : Monday, April 22, 2024-2:02:47 PM

Long-term archiving on: Tuesday, April 13, 2010-3:26:31 PM

Download

Dates and versions

inria-00201090 , version 1 (23-12-2007)

Identifiers

  • HAL Id : inria-00201090 , version 1
  • ARXIV : 0712.3916

Cite

Andreas Enge. Discrete logarithms in curves over finite fields. Eighth International Conference on Finite Fields and Applications - Fq8, Jul 2007, Melbourne, Australia. pp.119-139. ⟨inria-00201090⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

X CNRS INRIA IMB LIX X-LIX X-DEP-INFO INRIA2 TDS-MACS
425 View
695 Download

Altmetric

Share

Gmail Facebook X LinkedIn More