<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01102024</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-20T01:32:15+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">“Chinese &amp; Match”, an alternative to Atkin's “Match and Sort” method used in the SEA algorithm</title>
            <author role="aut">
              <persName>
                <forename type="first">Antoine</forename>
                <surname>Joux</surname>
              </persName>
              <email type="md5">ce698f651c917b2bfc2be9163641ac22</email>
              <email type="domain">m4x.org</email>
              <idno type="idhal" notation="string">antoine-joux</idno>
              <idno type="idhal" notation="numeric">4078</idno>
              <idno type="halauthorid" notation="string">24670-4078</idno>
              <idno type="IDREF">https://www.idref.fr/076330745</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2682-6508</idno>
              <affiliation ref="#struct-93591"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Reynald</forename>
                <surname>Lercier</surname>
              </persName>
              <email type="md5">070739a503c7128e9d8b597b68dbaea7</email>
              <email type="domain">univ-rennes1.fr</email>
              <idno type="idhal" notation="string">reynald-lercier</idno>
              <idno type="idhal" notation="numeric">2051</idno>
              <idno type="halauthorid" notation="string">363611-2051</idno>
              <idno type="IDREF">https://www.idref.fr/11637974X</idno>
              <affiliation ref="#struct-75"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Reynald</forename>
                <surname>Lercier</surname>
              </persName>
              <email type="md5">070739a503c7128e9d8b597b68dbaea7</email>
              <email type="domain">univ-rennes1.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-01-11 23:00:08</date>
              <date type="whenModified">2025-04-01 12:52:05</date>
              <date type="whenReleased">2015-01-11 23:00:08</date>
              <date type="whenProduced">2001-04</date>
              <ref type="externalLink" target="https://www.ams.org/mcom/2001-70-234/S0025-5718-00-01200-X/S0025-5718-00-01200-X.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="306113">
                <persName>
                  <forename>Reynald</forename>
                  <surname>Lercier</surname>
                </persName>
                <email type="md5">070739a503c7128e9d8b597b68dbaea7</email>
                <email type="domain">univ-rennes1.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01102024</idno>
            <idno type="halUri">https://hal.science/hal-01102024</idno>
            <idno type="halBibtex">joux:hal-01102024</idno>
            <idno type="halRefHtml">&lt;i&gt;Mathematics of Computation&lt;/i&gt;, 2001, 70 (234), pp.827-836. &lt;a target="_blank" href="https://dx.doi.org/10.1090/S0025-5718-00-01200-X"&gt;&amp;#x27E8;10.1090/S0025-5718-00-01200-X&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Mathematics of Computation, 2001, 70 (234), pp.827-836. &amp;#x27E8;10.1090/S0025-5718-00-01200-X&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="UNIV-RENNES1">Université de Rennes 1</idno>
            <idno type="stamp" n="IRMAR">Institut de Recherche Mathématique de Rennes</idno>
            <idno type="stamp" n="UR2-HB">Université Rennes 2 - Haute Bretagne</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INSA-RENNES">Institut National des Sciences Appliquées de Rennes</idno>
            <idno type="stamp" n="UNAM">l'unam - université nantes angers le mans</idno>
            <idno type="stamp" n="IRMAR-GAE" corresp="IRMAR">Géométrie et algèbre effectives </idno>
            <idno type="stamp" n="UR1-HAL">Publications labos UR1 dans HAL-Rennes 1</idno>
            <idno type="stamp" n="UR1-MATH-STIC">UR1 - publications Maths-STIC</idno>
            <idno type="stamp" n="AGREENIUM">Archive ouverte en agrobiosciences</idno>
            <idno type="stamp" n="UNIV-RENNES2">Université Rennes 2</idno>
            <idno type="stamp" n="TEST-UNIV-RENNES">TEST Université de Rennes</idno>
            <idno type="stamp" n="TEST-UR-CSS">TEST Université de Rennes CSS</idno>
            <idno type="stamp" n="UNIV-RENNES">Université de Rennes</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="UR1-MATH-NUM">Pôle UnivRennes - Mathématiques - Numérique </idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="INSTITUT-AGRO">Institut Agro</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">“Chinese &amp; Match”, an alternative to Atkin's “Match and Sort” method used in the SEA algorithm</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Antoine</forename>
                    <surname>Joux</surname>
                  </persName>
                  <email type="md5">ce698f651c917b2bfc2be9163641ac22</email>
                  <email type="domain">m4x.org</email>
                  <idno type="idhal" notation="string">antoine-joux</idno>
                  <idno type="idhal" notation="numeric">4078</idno>
                  <idno type="halauthorid" notation="string">24670-4078</idno>
                  <idno type="IDREF">https://www.idref.fr/076330745</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2682-6508</idno>
                  <affiliation ref="#struct-93591"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Reynald</forename>
                    <surname>Lercier</surname>
                  </persName>
                  <email type="md5">070739a503c7128e9d8b597b68dbaea7</email>
                  <email type="domain">univ-rennes1.fr</email>
                  <idno type="idhal" notation="string">reynald-lercier</idno>
                  <idno type="idhal" notation="numeric">2051</idno>
                  <idno type="halauthorid" notation="string">363611-2051</idno>
                  <idno type="IDREF">https://www.idref.fr/11637974X</idno>
                  <affiliation ref="#struct-75"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">16936</idno>
                <idno type="issn">0025-5718</idno>
                <idno type="eissn">1088-6842</idno>
                <title level="j">Mathematics of Computation</title>
                <imprint>
                  <publisher>American Mathematical Society</publisher>
                  <biblScope unit="volume">70</biblScope>
                  <biblScope unit="issue">234</biblScope>
                  <biblScope unit="pp">827-836</biblScope>
                  <date type="datePub">2001-04</date>
                  <date type="dateEpub">2000-03-02</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1090/S0025-5718-00-01200-X</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="math.math-ag">Mathematics [math]/Algebraic Geometry [math.AG]</classCode>
              <classCode scheme="halDomain" n="math.math-nt">Mathematics [math]/Number Theory [math.NT]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>A classical way to compute the number of points of elliptic curves defined over finite fields from partial data obtained in SEA (Schoof Elkies Atkin) algorithm is a so-called ``Match and Sort'' method due to Atkin.  This method is a ``baby step/giant step'' way to find the number of points among $C$ candidates with $O(\sqrt{C})$ elliptic curve additions.  Observing that the partial information modulo Atkin's primes is redundant, we propose to take advantage of this redundancy to eliminate the usual elliptic curve algebra in this phase of the SEA computation. This yields an algorithm of similar complexity, but the space needed is smaller than what Atkin's method requires. In practice, our technique amounts to an acceleration of Atkin's method, allowing us to count the number of points of an elliptic curve defined over $\mathbb{F}_{2^{1663}}$. As far as we know, this is the largest point-counting computation to date. Furthermore, the algorithm is easily parallelized.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-75" status="OLD">
          <idno type="IdRef">028233107</idno>
          <idno type="RNSR">199612396W</idno>
          <idno type="ROR">https://ror.org/05y76vp22</idno>
          <orgName>Institut de Recherche Mathématique de Rennes</orgName>
          <orgName type="acronym">IRMAR</orgName>
          <date type="start">1996-01-01</date>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>Campus de Beaulieu, bâtiments 22 et 23, 263 avenue du Général Leclerc, CS 7420535042  RENNES Cédex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://irmar.univ-rennes1.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-105160" type="direct"/>
            <relation active="#struct-117606" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-247362" type="direct"/>
            <relation active="#struct-406201" type="direct"/>
            <relation name="UMR6625" active="#struct-441569" type="direct"/>
            <relation active="#struct-1090536" type="direct"/>
            <relation active="#struct-1042499" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-105160" status="VALID">
          <idno type="IdRef">26693823X</idno>
          <idno type="ROR">https://ror.org/015m7wh34</idno>
          <orgName>Université de Rennes</orgName>
          <orgName type="acronym">UR</orgName>
          <desc>
            <address>
              <addrLine>Campus de Beaulieu, 263 avenue Général Leclerc, CS 74205, 35042 RENNES CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-rennes.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-117606" status="VALID">
          <idno type="ROR">https://ror.org/04xaa4j22</idno>
          <orgName>Institut National des Sciences Appliquées - Rennes</orgName>
          <orgName type="acronym">INSA Rennes</orgName>
          <desc>
            <address>
              <addrLine>20, avenue des Buttes de Coësmes - CS 70839 - 35708 Rennes cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-rennes.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-247362" status="VALID">
          <idno type="ROR">https://ror.org/03rxtdc22</idno>
          <orgName>École normale supérieure - Rennes</orgName>
          <orgName type="acronym">ENS Rennes</orgName>
          <desc>
            <address>
              <addrLine>Campus de Ker Lann - avenue Robert Schuman - 35170 Bruz</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-rennes.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-406201" status="VALID">
          <idno type="IdRef">054447658</idno>
          <idno type="ISNI">0000000121522279</idno>
          <idno type="ROR">https://ror.org/01m84wm78</idno>
          <orgName>Université de Rennes 2</orgName>
          <orgName type="acronym">UR2</orgName>
          <desc>
            <address>
              <addrLine>Place du recteur Henri Le Moal - CS 24307 - 35043 Rennes cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-rennes2.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</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"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-1090536" status="OLD">
          <idno type="ROR">https://ror.org/01s3fs709</idno>
          <orgName>INSTITUT AGRO Agrocampus Ouest</orgName>
          <date type="start">2020-01-01</date>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>65 rue de Saint Brieuc CS 84215 35042 Rennes CEDEX</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-1042499" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-1042499" status="VALID">
          <idno type="IdRef">260373249</idno>
          <idno type="ROR">https://ror.org/01dkyve95</idno>
          <orgName>Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement</orgName>
          <orgName type="acronym">Institut Agro</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.institut-agro.fr</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>