<?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-02424900</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-15T21:14:28+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">From Collisions to Chosen-Prefix Collisions</title>
            <title xml:lang="en" type="sub">Application to Full SHA-1</title>
            <author role="aut">
              <persName>
                <forename type="first">Gaëtan</forename>
                <surname>Leurent</surname>
              </persName>
              <email type="md5">15bd5566cb80c120e23293d7c3c1d669</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">gaetan-leurent</idno>
              <idno type="idhal" notation="numeric">951331</idno>
              <idno type="halauthorid" notation="string">525626-951331</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-5903-9055</idno>
              <affiliation ref="#struct-454686"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Thomas</forename>
                <surname>Peyrin</surname>
              </persName>
              <idno type="halauthorid">594481-0</idno>
              <affiliation ref="#struct-82545"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Gaëtan</forename>
                <surname>Leurent</surname>
              </persName>
              <email type="md5">15bd5566cb80c120e23293d7c3c1d669</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder>The second author is supported by Temasek Laboratories, Singapore</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-12-28 20:20:42</date>
              <date type="whenModified">2026-01-29 10:06:01</date>
              <date type="whenReleased">2020-01-06 10:13:39</date>
              <date type="whenProduced">2019-05-19</date>
              <date type="whenEndEmbargoed">2019-12-28</date>
              <ref type="file" target="https://inria.hal.science/hal-02424900v1/document">
                <date notBefore="2019-12-28"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-02424900v1/file/SHA1_EC19.pdf" id="file-2424900-2313156">
                <date notBefore="2019-12-28"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="190592">
                <persName>
                  <forename>Gaëtan</forename>
                  <surname>Leurent</surname>
                </persName>
                <email type="md5">15bd5566cb80c120e23293d7c3c1d669</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02424900</idno>
            <idno type="halUri">https://inria.hal.science/hal-02424900</idno>
            <idno type="halBibtex">leurent:hal-02424900</idno>
            <idno type="halRefHtml">&lt;i&gt;Eurocrypt 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques&lt;/i&gt;, May 2019, Darmstadt, Germany. pp.527-555, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-17659-4_18"&gt;&amp;#x27E8;10.1007/978-3-030-17659-4_18&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Eurocrypt 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2019, Darmstadt, Germany. pp.527-555, &amp;#x27E8;10.1007/978-3-030-17659-4_18&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-2424900-2313156"/></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>
            <idno type="stamp" n="INRIA-SINGAPOUR">INRIA-SINGAPOUR</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">From Collisions to Chosen-Prefix Collisions</title>
                <title xml:lang="en" type="sub">Application to Full SHA-1</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Gaëtan</forename>
                    <surname>Leurent</surname>
                  </persName>
                  <email type="md5">15bd5566cb80c120e23293d7c3c1d669</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">gaetan-leurent</idno>
                  <idno type="idhal" notation="numeric">951331</idno>
                  <idno type="halauthorid" notation="string">525626-951331</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-5903-9055</idno>
                  <affiliation ref="#struct-454686"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Thomas</forename>
                    <surname>Peyrin</surname>
                  </persName>
                  <idno type="halauthorid">594481-0</idno>
                  <affiliation ref="#struct-82545"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>Eurocrypt 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques</title>
                  <date type="start">2019-05-19</date>
                  <date type="end">2019-05-23</date>
                  <settlement>Darmstadt</settlement>
                  <country key="DE">Germany</country>
                </meeting>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">11478</biblScope>
                  <biblScope unit="pp">527-555</biblScope>
                  <date type="datePub">2019-04-24</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-17659-4_18</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">MD5</term>
                <term xml:lang="en">Cryptanalysis</term>
                <term xml:lang="en">Chosen-prefix collision</term>
                <term xml:lang="en">Hash function</term>
                <term xml:lang="en">SHA-1</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>A chosen-prefix collision attack is a stronger variant of a collision attack, where an arbitrary pair of challenge prefixes are turned into a collision. Chosen-prefix collisions are usually significantly harder to produce than (identical-prefix) collisions, but the practical impact of such an attack is much larger. While many cryptographic constructions rely on collision-resistance for their security proofs, collision attacks are hard to turn into a break of concrete protocols, because the adversary has limited control over the colliding messages. On the other hand, chosen-prefix collisions have been shown to threaten certificates (by creating a rogue CA) and many internet protocols (TLS, SSH, IKE). In this article, we propose new techniques to turn collision attacks into chosen-prefix collision attacks. Our strategy is composed of two phases: first a birthday search that aims at taking the random chaining variable difference (due to the chosen-prefix model) to a set of pre-defined target differences. Then, using a multi-block approach, carefully analysing the clustering effect, we map this new chaining variable difference to a colliding pair of states using techniques developed for collision attacks. We apply those techniques to MD5 and SHA-1, and obtain improved attacks. In particular, we have a chosen-prefix collision attack against SHA-1 with complexity between 2 66.9 and 2 69.4 (depending on assumptions about the cost of finding near-collision blocks), while the best-known attack has complexity 2 77.1. This is within a small factor of the complexity of the classical collision attack on SHA-1 (estimated as 2 64.7). This represents yet another warning that industries and users have to move away from using SHA-1 as soon as possible.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <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="laboratory" xml:id="struct-82545" status="VALID">
          <orgName>Division of Mathematical Sciences [Nanyang Technological University]</orgName>
          <orgName type="acronym">NTU | SPMS</orgName>
          <date type="start">2005-01-01</date>
          <desc>
            <address>
              <addrLine>School of Physical and Mathematical Sciences, College of Science, 21 Nanyang Link, Singapore 637371</addrLine>
              <country key="SG"/>
            </address>
            <ref type="url">https://www.ntu.edu.sg/spms/about-us/mathematics</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300732" type="direct"/>
          </listRelation>
        </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>
        <org type="institution" xml:id="struct-300732" status="VALID">
          <idno type="ROR">https://ror.org/02e7b5302</idno>
          <orgName>Nanyang Technological University [Singapour]</orgName>
          <orgName type="acronym">NTU</orgName>
          <date type="start">1955-01-01</date>
          <desc>
            <address>
              <addrLine>50 Nanyang Avenue, Singapour 639798</addrLine>
              <country key="SG"/>
            </address>
            <ref type="url">https://www.ntu.edu.sg/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>