<?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-01896036</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-19T16:33:42+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Quantum Algorithms for the k-xor Problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Lorenzo</forename>
                <surname>Grassi</surname>
              </persName>
              <email type="md5">d317b8bc7c1658db4f0a50de873ed342</email>
              <email type="domain">iaik.tugraz.at</email>
              <idno type="idhal" notation="numeric">1037470</idno>
              <idno type="halauthorid" notation="string">1437904-1037470</idno>
              <affiliation ref="#struct-263320"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">María</forename>
                <surname>Naya-Plasencia</surname>
              </persName>
              <email type="md5">fef881665e62c306a435531ce4fece16</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="numeric">836457</idno>
              <idno type="halauthorid" notation="string">670252-836457</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-0059-5417</idno>
              <idno type="IDREF">https://www.idref.fr/143284894</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/DJR-7281-2022</idno>
              <idno type="VIAF">https://viaf.org/viaf/198969544</idno>
              <idno type="ISNI">http://isni.org/isni/0000000357538226</idno>
              <affiliation ref="#struct-454686"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">André</forename>
                <surname>Schrottenloher</surname>
              </persName>
              <email type="md5">24c494a4cfce8f8b0b0e67a1882944dc</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">andre-schrottenloher</idno>
              <idno type="idhal" notation="numeric">1084912</idno>
              <idno type="halauthorid" notation="string">1271690-1084912</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-1329-8630</idno>
              <idno type="IDREF">https://www.idref.fr/25998860X</idno>
              <affiliation ref="#struct-454686"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>André</forename>
                <surname>Schrottenloher</surname>
              </persName>
              <email type="md5">24c494a4cfce8f8b0b0e67a1882944dc</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-10-15 17:18:51</date>
              <date type="whenModified">2025-07-22 08:34:02</date>
              <date type="whenReleased">2018-10-16 08:50:05</date>
              <date type="whenProduced">2018-12-02</date>
              <date type="whenEndEmbargoed">2018-10-15</date>
              <ref type="file" target="https://inria.hal.science/hal-01896036v1/document">
                <date notBefore="2018-10-15"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01896036v1/file/3xor.pdf" id="file-1896036-1925974">
                <date notBefore="2018-10-15"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="529640">
                <persName>
                  <forename>André</forename>
                  <surname>Schrottenloher</surname>
                </persName>
                <email type="md5">24c494a4cfce8f8b0b0e67a1882944dc</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01896036</idno>
            <idno type="halUri">https://inria.hal.science/hal-01896036</idno>
            <idno type="halBibtex">grassi:hal-01896036</idno>
            <idno type="halRefHtml">&lt;i&gt;ASIACRYPT 2018 - 24th Annual International Conference on the Theory and Application of Cryptology and Information Security&lt;/i&gt;, Dec 2018, Brisbane, Australia. pp.527-559, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-03326-2_18"&gt;&amp;#x27E8;10.1007/978-3-030-03326-2_18&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">ASIACRYPT 2018 - 24th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2018, Brisbane, Australia. pp.527-559, &amp;#x27E8;10.1007/978-3-030-03326-2_18&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1896036-1925974"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</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">Quantum Algorithms for the k-xor Problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Lorenzo</forename>
                    <surname>Grassi</surname>
                  </persName>
                  <email type="md5">d317b8bc7c1658db4f0a50de873ed342</email>
                  <email type="domain">iaik.tugraz.at</email>
                  <idno type="idhal" notation="numeric">1037470</idno>
                  <idno type="halauthorid" notation="string">1437904-1037470</idno>
                  <affiliation ref="#struct-263320"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">María</forename>
                    <surname>Naya-Plasencia</surname>
                  </persName>
                  <email type="md5">fef881665e62c306a435531ce4fece16</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="numeric">836457</idno>
                  <idno type="halauthorid" notation="string">670252-836457</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-0059-5417</idno>
                  <idno type="IDREF">https://www.idref.fr/143284894</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/DJR-7281-2022</idno>
                  <idno type="VIAF">https://viaf.org/viaf/198969544</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000357538226</idno>
                  <affiliation ref="#struct-454686"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">André</forename>
                    <surname>Schrottenloher</surname>
                  </persName>
                  <email type="md5">24c494a4cfce8f8b0b0e67a1882944dc</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">andre-schrottenloher</idno>
                  <idno type="idhal" notation="numeric">1084912</idno>
                  <idno type="halauthorid" notation="string">1271690-1084912</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-1329-8630</idno>
                  <idno type="IDREF">https://www.idref.fr/25998860X</idno>
                  <affiliation ref="#struct-454686"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>ASIACRYPT 2018 - 24th Annual International Conference on the Theory and Application of Cryptology and Information Security</title>
                  <date type="start">2018-12-02</date>
                  <date type="end">2018-12-06</date>
                  <settlement>Brisbane</settlement>
                  <country key="AU">Australia</country>
                </meeting>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">LNCS - Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">11272</biblScope>
                  <biblScope unit="pp">527-559</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-03326-2_18</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">K-xor</term>
                <term xml:lang="en">Quantum cryptanalysis</term>
                <term xml:lang="en">Amplitude amplification</term>
                <term xml:lang="en">3-xor</term>
                <term xml:lang="en">Quantum algorithms</term>
                <term xml:lang="en">List-merging algorithms</term>
                <term xml:lang="en">Generalized birthday problem</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-cr">Computer Science [cs]/Cryptography and Security [cs.CR]</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>The k-xor (or generalized birthday) problem is a widely studied question with many applications in cryptography. It aims at finding k elements of n bits, drawn at random, such that the xor of all of them is 0. The algorithms proposed by Wagner more than fifteen years ago remain the best known classical algorithms for solving them, when disregarding logarithmic factors. In this paper we study these problems in the quantum setting, when considering that the elements are created by querying a random function (or k random functions) H : {0, 1} n → {0, 1} n. We consider two scenarios: in one we are able to use a limited amount of quantum memory (i.e. a number O(n) of qubits, the same as the one needed by Grover's search algorithm), and in the other we consider that the algorithm can use an exponential amount of qubits. Our newly proposed algorithms are of general interest. In both settings, they provide the best known quantum time complexities. In particular, we are able to considerately improve the 3-xor algorithm: with limited qubits, we reach a complexity considerably better than what is currently possible for quantum collision search. Furthermore, when having access to exponential amounts of quantum memory, we can take this complexity below O(2 n/3), the well-known lower bound of quantum collision search, clearly improving the best known quantum time complexity also in this setting. We illustrate the importance of these results with some cryptographic applications.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-263320" status="VALID">
          <orgName>Institute of Applied Information Processing  and Communications [Graz]</orgName>
          <orgName type="acronym">IAIK</orgName>
          <desc>
            <address>
              <addrLine>Inffeldgasse 16aA-8010 Graz</addrLine>
              <country key="AT"/>
            </address>
            <ref type="url">http://www.iaik.tugraz.at/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-65509" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-454686" status="OLD">
          <idno type="RNSR">200818335Z</idno>
          <orgName>Security, Cryptology and Transmissions</orgName>
          <orgName type="acronym">SECRET</orgName>
          <date type="start">2016-01-01</date>
          <date type="end">2019-11-30</date>
          <desc>
            <address>
              <addrLine>2, rue Simone Iff. 75589 Paris Cedex 12</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/secret</ref>
          </desc>
          <listRelation>
            <relation active="#struct-454310" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-65509" status="VALID">
          <idno type="ROR">https://ror.org/00d7xrm67</idno>
          <orgName>Graz University of Technology [Graz]</orgName>
          <orgName type="acronym">TU Graz</orgName>
          <desc>
            <address>
              <addrLine>Rechbauerstr. 12,  8010 Graz</addrLine>
              <country key="AT"/>
            </address>
            <ref type="url">https://www.tugraz.at/en/home/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-454310" status="VALID">
          <idno type="IdRef">241614864</idno>
          <idno type="RNSR">196718247G</idno>
          <idno type="ROR">https://ror.org/05eyd5d35</idno>
          <orgName>Centre Inria de Paris</orgName>
          <date type="start">2016-03-10</date>
          <desc>
            <address>
              <addrLine>48 Rue Barrault, 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" 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>
      </listOrg>
    </back>
  </text>
</TEI>