Counting Points on Genus 2 Curves with Real Multiplication
Identifieur interne : 002726 ( Main/Curation ); précédent : 002725; suivant : 002727Counting Points on Genus 2 Curves with Real Multiplication
Auteurs : Pierrick Gaudry [France] ; David Kohel [France] ; Benjamin Smith [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite field $\mathbb{F}_{q}$ of large characteristic from ${\widetilde{O}}(\log^8 q)$ to ${\widetilde{O}}(\log^5 q)$ . Using our algorithm we compute a 256-bit prime-order Jacobian, suitable for cryptographic applications, and also the order of a 1024-bit Jacobian.
Url:
DOI: 10.1007/978-3-642-25385-0_27
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003865
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :003822
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000626
- to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001974
- to stream Hal, to step Curation: Pour aller vers cette notice dans l'étape Curation :001974
- to stream Hal, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :001A19
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :002768
Links to Exploration step
ISTEX:EC9C7D38614D770F59CC22859483167DBB6F6521Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Counting Points on Genus 2 Curves with Real Multiplication</title>
<author><name sortKey="Gaudry, Pierrick" sort="Gaudry, Pierrick" uniqKey="Gaudry P" first="Pierrick" last="Gaudry">Pierrick Gaudry</name>
</author>
<author><name sortKey="Kohel, David" sort="Kohel, David" uniqKey="Kohel D" first="David" last="Kohel">David Kohel</name>
</author>
<author><name sortKey="Smith, Benjamin" sort="Smith, Benjamin" uniqKey="Smith B" first="Benjamin" last="Smith">Benjamin Smith</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:EC9C7D38614D770F59CC22859483167DBB6F6521</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-3-642-25385-0_27</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-S201BS36-G/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">003865</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003865</idno>
<idno type="wicri:Area/Istex/Curation">003822</idno>
<idno type="wicri:Area/Istex/Checkpoint">000626</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000626</idno>
<idno type="wicri:doubleKey">0302-9743:2011:Gaudry P:counting:points:on</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00598029</idno>
<idno type="url">https://hal.inria.fr/inria-00598029</idno>
<idno type="wicri:Area/Hal/Corpus">001974</idno>
<idno type="wicri:Area/Hal/Curation">001974</idno>
<idno type="wicri:Area/Hal/Checkpoint">001A19</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">001A19</idno>
<idno type="wicri:Area/Main/Merge">002768</idno>
<idno type="wicri:Area/Main/Curation">002726</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Counting Points on Genus 2 Curves with Real Multiplication</title>
<author><name sortKey="Gaudry, Pierrick" sort="Gaudry, Pierrick" uniqKey="Gaudry P" first="Pierrick" last="Gaudry">Pierrick Gaudry</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>LORIA, CNRS / INRIA / Nancy Université, Campus Scientifique, BP 239, 54500, Vandoeuvre lès Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Kohel, David" sort="Kohel, David" uniqKey="Kohel D" first="David" last="Kohel">David Kohel</name>
<affiliation wicri:level="4"><country xml:lang="fr">France</country>
<wicri:regionArea>Institut de Mathématiques de Luminy, Université de la Méditerranée, 163, avenue de Luminy, Case 907, 13288, Marseille Cedex 9</wicri:regionArea>
<placeName><region type="region" nuts="2">Provence-Alpes-Côte d'Azur</region>
<settlement type="city">Marseille</settlement>
</placeName>
<orgName type="university">Université de la Méditerranée</orgName>
</affiliation>
</author>
<author><name sortKey="Smith, Benjamin" sort="Smith, Benjamin" uniqKey="Smith B" first="Benjamin" last="Smith">Benjamin Smith</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>INRIA Saclay–Île-de-France, Laboratoire d’Informatique de l’École polytechnique (LIX), 91128, Palaiseau Cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Île-de-France</region>
<settlement type="city">Palaiseau</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite field $\mathbb{F}_{q}$ of large characteristic from ${\widetilde{O}}(\log^8 q)$ to ${\widetilde{O}}(\log^5 q)$ . Using our algorithm we compute a 256-bit prime-order Jacobian, suitable for cryptographic applications, and also the order of a 1024-bit Jacobian.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002726 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 002726 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Curation |type= RBID |clé= ISTEX:EC9C7D38614D770F59CC22859483167DBB6F6521 |texte= Counting Points on Genus 2 Curves with Real Multiplication }}
This area was generated with Dilib version V0.6.33. |