Afficher la notice abrégée

hal.structure.identifierAlgorithmic number theory for cryptology [TANC]
dc.contributor.authorENGE, Andreas
hal.structure.identifierCurves, Algebra, Computer Arithmetic, and so On [CACAO]
dc.contributor.authorGAUDRY, Pierrick
dc.contributor.editorMoni Naor
dc.date.issued2007
dc.date.conference2007-05-20
dc.description.abstractEnThe discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose degrees in $X$ and $Y$ are low with respect to the curve genus, and suitably unbalanced. The finite base fields are arbitrary, but their sizes should not grow too fast compared to the genus. For this family, the group structure can be computed in subexponential time of $L_{q^g}(1/3, O(1))$, and a discrete logarithm computation takes subexponential time of $L_{q^g}(1/3+\varepsilon, o(1))$ for any positive~$\varepsilon$. These runtime bounds rely on heuristics similar to the ones used in the number field sieve or the function field sieve algorithms.
dc.language.isoen
dc.publisherSpringer
dc.title.enAn $L (1/3 + \varepsilon)$ Algorithm for the Discrete Logarithm Problem for Low Degree Curves
dc.typeCommunication dans un congrès avec actes
dc.subject.halInformatique [cs]/Cryptographie et sécurité [cs.CR]
dc.subject.halMathématiques [math]/Géométrie algébrique [math.AG]
dc.identifier.arxivcs.CR/0703032
bordeaux.page379-393
bordeaux.volume4515
bordeaux.countryES
bordeaux.title.proceedingEurocrypt 2007
bordeaux.conference.cityBarcelona
bordeaux.peerReviewedoui
hal.identifierinria-00135324
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00135324v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2007&rft.volume=4515&rft.spage=379-393&rft.epage=379-393&rft.au=ENGE,%20Andreas&GAUDRY,%20Pierrick&rft.genre=proceeding


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée