<?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 ensl-00534899v2</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-17T21:23:12+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">An LLL-reduction algorithm with quasi-linear time complexity</title>
            <author role="aut">
              <persName>
                <forename type="first">Andrew</forename>
                <surname>Novocin</surname>
              </persName>
              <email type="md5">8b4ea0eb26d22d923e31e505637c8bf4</email>
              <email type="domain">ens-lyon.fr</email>
              <idno type="idhal" notation="numeric">881949</idno>
              <idno type="halauthorid" notation="string">440264-881949</idno>
              <affiliation ref="#struct-35418"/>
              <affiliation ref="#struct-2371"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Damien</forename>
                <surname>Stehlé</surname>
              </persName>
              <email type="md5">7a5019dda3548244c1a3c66808f8e607</email>
              <email type="domain">ens-lyon.fr</email>
              <idno type="idhal" notation="numeric">837772</idno>
              <idno type="halauthorid" notation="string">113160-837772</idno>
              <affiliation ref="#struct-35418"/>
              <affiliation ref="#struct-2371"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Gilles</forename>
                <surname>Villard</surname>
              </persName>
              <email type="md5">685346eed33ebbbc5515322e3cff0d0c</email>
              <email type="domain">ens-lyon.fr</email>
              <idno type="idhal" notation="numeric">1292387</idno>
              <idno type="halauthorid" notation="string">105320-1292387</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-1936-7155</idno>
              <idno type="IDREF">https://www.idref.fr/034243232</idno>
              <idno type="VIAF">https://viaf.org/viaf/221788984</idno>
              <idno type="ISNI">http://isni.org/isni/0000000361835928</idno>
              <affiliation ref="#struct-35418"/>
              <affiliation ref="#struct-2371"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Gilles</forename>
                <surname>Villard</surname>
              </persName>
              <email type="md5">1e5b651b9d51dffe2e6e98eafa8fa180</email>
              <email type="domain">cnrs.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2010-11-10 18:39:36</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2011-04-07 16:13:04</date>
              <date type="whenModified">2025-10-13 09:44:14</date>
              <date type="whenReleased">2011-04-07 16:28:45</date>
              <date type="whenProduced">2011</date>
              <date type="whenEndEmbargoed">2011-04-07</date>
              <ref type="file" target="https://ens-lyon.hal.science/ensl-00534899v2/document">
                <date notBefore="2011-04-07"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://ens-lyon.hal.science/ensl-00534899v2/file/L1-hal.pdf" id="file-584157-745817">
                <date notBefore="2011-04-07"/>
              </ref>
              <ref type="externalLink" target="http://andy.novocin.com/pro/L1-hal.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="102342">
                <persName>
                  <forename>Gilles</forename>
                  <surname>Villard</surname>
                </persName>
                <email type="md5">1e5b651b9d51dffe2e6e98eafa8fa180</email>
                <email type="domain">cnrs.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">ensl-00534899</idno>
            <idno type="halUri">https://ens-lyon.hal.science/ensl-00534899</idno>
            <idno type="halBibtex">novocin:ensl-00534899</idno>
            <idno type="halRefHtml">&lt;i&gt;STOC'11 - 43rd annual ACM symposium on Theory of computing&lt;/i&gt;, 2011, San Jose, United States. pp.403-412, &lt;a target="_blank" href="https://dx.doi.org/10.1145/1993636.1993691"&gt;&amp;#x27E8;10.1145/1993636.1993691&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">STOC'11 - 43rd annual ACM symposium on Theory of computing, 2011, San Jose, United States. pp.403-412, &amp;#x27E8;10.1145/1993636.1993691&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-584157-745817"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</idno>
            <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="UNIV-LYON1">Université Claude Bernard - Lyon I</idno>
            <idno type="stamp" n="INRIA-RHA">INRIA Grenoble - Rhône-Alpes</idno>
            <idno type="stamp" n="LIP" corresp="UNIV-LYON1">Laboratoire de l'Informatique du Parallélisme</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="INRIA-RENGRE">INRIA-RENGRE</idno>
            <idno type="stamp" n="UDL">UDL</idno>
            <idno type="stamp" n="UNIV-LYON">Université de Lyon</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">An LLL-reduction algorithm with quasi-linear time complexity</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Andrew</forename>
                    <surname>Novocin</surname>
                  </persName>
                  <email type="md5">8b4ea0eb26d22d923e31e505637c8bf4</email>
                  <email type="domain">ens-lyon.fr</email>
                  <idno type="idhal" notation="numeric">881949</idno>
                  <idno type="halauthorid" notation="string">440264-881949</idno>
                  <affiliation ref="#struct-35418"/>
                  <affiliation ref="#struct-2371"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Damien</forename>
                    <surname>Stehlé</surname>
                  </persName>
                  <email type="md5">7a5019dda3548244c1a3c66808f8e607</email>
                  <email type="domain">ens-lyon.fr</email>
                  <idno type="idhal" notation="numeric">837772</idno>
                  <idno type="halauthorid" notation="string">113160-837772</idno>
                  <affiliation ref="#struct-35418"/>
                  <affiliation ref="#struct-2371"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Gilles</forename>
                    <surname>Villard</surname>
                  </persName>
                  <email type="md5">685346eed33ebbbc5515322e3cff0d0c</email>
                  <email type="domain">ens-lyon.fr</email>
                  <idno type="idhal" notation="numeric">1292387</idno>
                  <idno type="halauthorid" notation="string">105320-1292387</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-1936-7155</idno>
                  <idno type="IDREF">https://www.idref.fr/034243232</idno>
                  <idno type="VIAF">https://viaf.org/viaf/221788984</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000361835928</idno>
                  <affiliation ref="#struct-35418"/>
                  <affiliation ref="#struct-2371"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of the 43rd annual ACM symposium on Theory of computing</title>
                <meeting>
                  <title>STOC'11 - 43rd annual ACM symposium on Theory of computing</title>
                  <date type="start">2011</date>
                  <settlement>San Jose</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <publisher>ACM New York, NY, USA</publisher>
                  <biblScope unit="pp">403-412</biblScope>
                  <date type="datePub">2011</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1145/1993636.1993691</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">lattice basis reduction</term>
                <term xml:lang="en">LLL</term>
                <term xml:lang="en">computational complexity</term>
                <term xml:lang="en">bit complexity</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halDomain" n="info.info-na">Computer Science [cs]/Numerical Analysis [cs.NA]</classCode>
              <classCode scheme="halDomain" n="info.info-sc">Computer Science [cs]/Symbolic Computation [cs.SC]</classCode>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We devise an algorithm, L1 tilde, with the following specifications: It takes as input an arbitrary basis B=(b_i)_i in Z^{d x d} of a Euclidean lattice L; It computes a basis of L which is reduced for a mild modification of the Lenstra-Lenstra-Lovász reduction; It terminates in time O(d^{5+eps} beta + d^{omega+1+eps} beta^{1+eps}) where beta = log max ||b_i|| (for any eps &gt; 0 and omega is a valid exponent for matrix multiplication). This is the first LLL-reducing algorithm with a time complexity that is quasi-linear in the bit-length beta of the entries and polynomial in the dimension d. The backbone structure of L1 tilde is able to mimic the Knuth-Schönhage fast gcd algorithm thanks to a combination of cutting-edge ingredients. First the bit-size of our lattice bases can be decreased via truncations whose validity are backed by recent numerical stability results on the QR matrix factorization. Also we establish a new framework for analyzing unimodular transformation matrices which reduce shifts of reduced bases, this includes bit-size control and new perturbation tools. We illustrate the power of this framework by generating a family of reduction algorithms.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-35418" status="VALID">
          <idno type="IdRef">191041289</idno>
          <idno type="ISNI">0000000104538607</idno>
          <idno type="RNSR">200317503S</idno>
          <idno type="ROR">04msnz457</idno>
          <orgName>Laboratoire de l'Informatique du Parallélisme</orgName>
          <orgName type="acronym">LIP</orgName>
          <date type="start">1990-01-01</date>
          <desc>
            <address>
              <addrLine>46 Allée d'Italie 69364 LYON CEDEX 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-lyon.fr/LIP/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6818" type="direct"/>
            <relation active="#struct-301088" type="direct"/>
            <relation active="#struct-194495" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="UMR5668 / URA1398" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-2371" status="OLD">
          <idno type="RNSR">199818277E</idno>
          <orgName>Computer arithmetic</orgName>
          <orgName type="acronym">ARENAIRE</orgName>
          <desc>
            <address>
              <addrLine>ENS Lyon - Laboratoire de l'Informatique du Parallélisme (LIP)46 Allée d'Italie 69364 Lyon France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/arenaire</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2497" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-35418" type="direct"/>
            <relation active="#struct-6818" type="indirect"/>
            <relation active="#struct-301088" type="indirect"/>
            <relation active="#struct-194495" type="indirect"/>
            <relation name="UMR5668 / URA1398" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-6818" status="VALID">
          <idno type="IdRef">149154992</idno>
          <idno type="ISNI">0000000123319856</idno>
          <idno type="ROR">https://ror.org/04zmssz18</idno>
          <idno type="Wikidata">Q10159</idno>
          <orgName>École normale supérieure de Lyon</orgName>
          <orgName type="acronym">ENS de Lyon</orgName>
          <date type="start">2010-01-01</date>
          <desc>
            <address>
              <addrLine>15 parvis René Descartes - BP 7000 - 69342 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ens-lyon.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301088" status="VALID">
          <idno type="ROR">https://ror.org/01rk35k63</idno>
          <orgName>Université de Lyon</orgName>
          <desc>
            <address>
              <addrLine>92 rue Pasteur - CS 30122, 69361 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-lyon.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-194495" status="VALID">
          <idno type="IdRef">026402823</idno>
          <idno type="ISNI">0000000121686185</idno>
          <idno type="ROR">https://ror.org/029brtt94</idno>
          <orgName>Université Claude Bernard Lyon 1</orgName>
          <orgName type="acronym">UCBL</orgName>
          <desc>
            <address>
              <addrLine>43, boulevard du 11 novembre 1918, 69622 Villeurbanne cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lyon1.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <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"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</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="laboratory" xml:id="struct-2497" status="VALID">
          <idno type="RNSR">199218244V</idno>
          <idno type="ROR">https://ror.org/00n8d6z93</idno>
          <orgName>Centre Inria de l'Université Grenoble Alpes</orgName>
          <desc>
            <address>
              <addrLine>Inovallée655 avenue de l'Europe38330 Montbonnot</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/grenoble</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>