InforLorV4, Hal, Checkpoint, bibRecord, 000116

Recent progress on the elliptic curve discrete logarithm problem

Identifieur interne : 000116 ( Hal/Checkpoint ); précédent : 000115; suivant : 000117

Recent progress on the elliptic curve discrete logarithm problem

Auteurs : Steven Galbraith [Nouvelle-Zélande] ; Pierrick Gaudry [France]

Source :

Designs, Codes and Cryptography [ 0925-1022 ] ; 2016.

RBID : Hal:hal-01215623

Abstract

We survey recent work on the elliptic curve discrete logarithm problem. In particular we review index calculus algorithms using summation polynomials, and claims about their complexity.

Url:

https://hal.inria.fr/hal-01215623

DOI: 10.1007/s10623-015-0146-7

Links toward previous steps (curation, corpus...)

to stream Hal, to step Corpus: 003F95
to stream Hal, to step Curation: 003F95

Links to Exploration step

Hal:hal-01215623

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Recent progress on the elliptic curve discrete logarithm problem</title>
<author><name sortKey="Galbraith, Steven" sort="Galbraith, Steven" uniqKey="Galbraith S" first="Steven" last="Galbraith">Steven Galbraith</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-133271" status="VALID"><orgName>Department of Mathematics [Auckland]</orgName>
<desc><address><addrLine>Department of Mathematics University of Auckland Private Bag 92019 Auckland Mail Centre Auckland 1142 NEW ZEALAND</addrLine>
<country key="NZ"></country>
</address>
<ref type="url">http://www.math.auckland.ac.nz/</ref>
</desc>
<listRelation><relation active="#struct-160272" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160272" type="direct"><org type="institution" xml:id="struct-160272" status="VALID"><orgName>University of Auckland [Auckland]</orgName>
<desc><address><addrLine>Private Bag 92019 Auckland 1142</addrLine>
<country key="NZ"></country>
</address>
<ref type="url">https://www.auckland.ac.nz/en.html</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Nouvelle-Zélande</country>
</affiliation>
</author>
<author><name sortKey="Gaudry, Pierrick" sort="Gaudry, Pierrick" uniqKey="Gaudry P" first="Pierrick" last="Gaudry">Pierrick Gaudry</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-119560" status="VALID"><idno type="RNSR">201020971F</idno>
<orgName>Cryptology, Arithmetic: Hardware and Software</orgName>
<orgName type="acronym">CARAMEL</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/caramel</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423083" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423083" type="direct"><org type="department" xml:id="struct-423083" status="VALID"><orgName>Department of Algorithms, Computation, Image and Geometry</orgName>
<orgName type="acronym">LORIA - ALGO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/algorithmics</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01215623</idno>
<idno type="halId">hal-01215623</idno>
<idno type="halUri">https://hal.inria.fr/hal-01215623</idno>
<idno type="url">https://hal.inria.fr/hal-01215623</idno>
<idno type="doi">10.1007/s10623-015-0146-7</idno>
<date when="2016">2016</date>
<idno type="wicri:Area/Hal/Corpus">003F95</idno>
<idno type="wicri:Area/Hal/Curation">003F95</idno>
<idno type="wicri:Area/Hal/Checkpoint">000116</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000116</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Recent progress on the elliptic curve discrete logarithm problem</title>
<author><name sortKey="Galbraith, Steven" sort="Galbraith, Steven" uniqKey="Galbraith S" first="Steven" last="Galbraith">Steven Galbraith</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-133271" status="VALID"><orgName>Department of Mathematics [Auckland]</orgName>
<desc><address><addrLine>Department of Mathematics University of Auckland Private Bag 92019 Auckland Mail Centre Auckland 1142 NEW ZEALAND</addrLine>
<country key="NZ"></country>
</address>
<ref type="url">http://www.math.auckland.ac.nz/</ref>
</desc>
<listRelation><relation active="#struct-160272" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160272" type="direct"><org type="institution" xml:id="struct-160272" status="VALID"><orgName>University of Auckland [Auckland]</orgName>
<desc><address><addrLine>Private Bag 92019 Auckland 1142</addrLine>
<country key="NZ"></country>
</address>
<ref type="url">https://www.auckland.ac.nz/en.html</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Nouvelle-Zélande</country>
</affiliation>
</author>
<author><name sortKey="Gaudry, Pierrick" sort="Gaudry, Pierrick" uniqKey="Gaudry P" first="Pierrick" last="Gaudry">Pierrick Gaudry</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-119560" status="VALID"><idno type="RNSR">201020971F</idno>
<orgName>Cryptology, Arithmetic: Hardware and Software</orgName>
<orgName type="acronym">CARAMEL</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/caramel</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423083" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423083" type="direct"><org type="department" xml:id="struct-423083" status="VALID"><orgName>Department of Algorithms, Computation, Image and Geometry</orgName>
<orgName type="acronym">LORIA - ALGO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/algorithmics</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1007/s10623-015-0146-7</idno>
<series><title level="j">Designs, Codes and Cryptography</title>
<idno type="ISSN">0925-1022</idno>
<imprint><date type="datePub">2016</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We survey recent work on the elliptic curve discrete logarithm problem. In particular we review index calculus algorithms using summation polynomials, and claims about their complexity.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Recent progress on the elliptic curve discrete logarithm problem</title>
<author role="aut"><persName><forename type="first">Steven</forename>
<surname>Galbraith</surname>
</persName>
<email>s.galbraith@auckland.ac.nz</email>
<idno type="halauthor">1233133</idno>
<affiliation ref="#struct-133271"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Pierrick</forename>
<surname>Gaudry</surname>
</persName>
<email></email>
<idno type="idhal">pierrickgaudry</idno>
<idno type="halauthor">457720</idno>
<affiliation ref="#struct-119560"></affiliation>
</author>
<editor role="depositor"><persName><forename>Pierrick</forename>
<surname>Gaudry</surname>
</persName>
<email>pierrick.gaudry@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2015-10-14 15:36:39</date>
<date type="whenModified">2016-01-26 15:29:30</date>
<date type="whenReleased">2015-10-16 17:44:44</date>
<date type="whenProduced">2016</date>
<date type="whenEndEmbargoed">2015-10-14</date>
<ref type="file" target="https://hal.inria.fr/hal-01215623/document"><date notBefore="2015-10-14"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal.inria.fr/hal-01215623/file/DCC-survey.pdf"><date notBefore="2015-10-14"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="103933"><persName><forename>Pierrick</forename>
<surname>Gaudry</surname>
</persName>
<email>pierrick.gaudry@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-01215623</idno>
<idno type="halUri">https://hal.inria.fr/hal-01215623</idno>
<idno type="halBibtex">galbraith:hal-01215623</idno>
<idno type="halRefHtml">Designs, Codes and Cryptography, Springer Verlag, 2016, 78 (1), pp.51-72. <10.1007/s10623-015-0146-7></idno>
<idno type="halRef">Designs, Codes and Cryptography, Springer Verlag, 2016, 78 (1), pp.51-72. <10.1007/s10623-015-0146-7></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA-ACGI" p="LORIA">Algorithmique, calcul, image et géométrie</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA2">INRIA 2</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-ALGO-TEST5">LORIA-ALGO-TEST5  </idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Recent progress on the elliptic curve discrete logarithm problem</title>
<author role="aut"><persName><forename type="first">Steven</forename>
<surname>Galbraith</surname>
</persName>
<email>s.galbraith@auckland.ac.nz</email>
<idno type="halAuthorId">1233133</idno>
<affiliation ref="#struct-133271"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Pierrick</forename>
<surname>Gaudry</surname>
</persName>
<idno type="idHal">pierrickgaudry</idno>
<idno type="halAuthorId">457720</idno>
<affiliation ref="#struct-119560"></affiliation>
</author>
</analytic>
<monogr><idno type="halJournalId" status="VALID">12540</idno>
<idno type="issn">0925-1022</idno>
<idno type="eissn">1573-7586</idno>
<title level="j">Designs, Codes and Cryptography</title>
<imprint><publisher>Springer Verlag</publisher>
<biblScope unit="volume">78</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="pp">51-72</biblScope>
<date type="datePub">2016</date>
</imprint>
</monogr>
<idno type="doi">10.1007/s10623-015-0146-7</idno>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><classCode scheme="halDomain" n="info.info-cr">Computer Science [cs]/Cryptography and Security [cs.CR]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">We survey recent work on the elliptic curve discrete logarithm problem. In particular we review index calculus algorithms using summation polynomials, and claims about their complexity.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000116 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 000116 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Hal:hal-01215623
   |texte=   Recent progress on the elliptic curve discrete logarithm problem
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Recent progress on the elliptic curve discrete logarithm problem

Recent progress on the elliptic curve discrete logarithm problem

Source :

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri