<?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-04748002</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-24T16:08:42+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A Note on Related-Tweakey Impossible Differential Attacks</title>
            <author role="aut">
              <persName>
                <forename type="first">Xavier</forename>
                <surname>Bonnetain</surname>
              </persName>
              <email type="md5">aaf3eada80d67f9b81dde2e56e545bba</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="numeric">1023884</idno>
              <idno type="halauthorid" notation="string">1089379-1023884</idno>
              <idno type="IDREF">https://www.idref.fr/245285385</idno>
              <affiliation ref="#struct-450090"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Virginie</forename>
                <surname>Lallemand</surname>
              </persName>
              <email type="md5">bc45d5e7c065fcfbeb25cf2c80a35762</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">virginie-lallemand</idno>
              <idno type="idhal" notation="numeric">739455</idno>
              <idno type="halauthorid" notation="string">42693-739455</idno>
              <idno type="IDREF">https://www.idref.fr/203634438</idno>
              <affiliation ref="#struct-450090"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Virginie</forename>
                <surname>Lallemand</surname>
              </persName>
              <email type="md5">bc45d5e7c065fcfbeb25cf2c80a35762</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder ref="#projanr-72352"/>
            <funder ref="#projanr-98294"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2024-11-02 18:39:37</date>
              <date type="whenModified">2025-11-04 12:02:52</date>
              <date type="whenReleased">2024-11-04 08:29:11</date>
              <date type="whenProduced">2024-10-07</date>
              <date type="whenEndEmbargoed">2024-11-02</date>
              <ref type="file" target="https://hal.science/hal-04748002v1/document">
                <date notBefore="2024-11-02"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-04748002v1/file/main.pdf" id="file-4763722-4148209">
                <date notBefore="2024-11-02"/>
              </ref>
              <ref type="externalLink" target="https://doi.org/10.62056/abbn-4c2h"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="190277">
                <persName>
                  <forename>Virginie</forename>
                  <surname>Lallemand</surname>
                </persName>
                <email type="md5">bc45d5e7c065fcfbeb25cf2c80a35762</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04748002</idno>
            <idno type="halUri">https://hal.science/hal-04748002</idno>
            <idno type="halBibtex">bonnetain:hal-04748002</idno>
            <idno type="halRefHtml">&lt;i&gt;IACR Communications in Cryptology&lt;/i&gt;, 2024, 1 (3), &lt;a target="_blank" href="https://dx.doi.org/10.62056/abbn-4c2h"&gt;&amp;#x27E8;10.62056/abbn-4c2h&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">IACR Communications in Cryptology, 2024, 1 (3), &amp;#x27E8;10.62056/abbn-4c2h&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-4763722-4148209"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <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="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="LORIA-ALGO-TEST5">LORIA-ALGO-TEST5  </idno>
            <idno type="stamp" n="LORIA">Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
            <idno type="stamp" n="LORIA-ALGO" corresp="LORIA">Department of Algorithms, Computation, Image and Geometry</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="CYBERSCURITE">PEPR Cybersécurité</idno>
            <idno type="stamp" n="CRYPTANALYSE">CRYPTANALYSE</idno>
            <idno type="stamp" n="AM2I-UL">Pôle scientifique Automatique, Mathématiques, Informatique et leurs Intéractions de l'Université de Lorraine</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">A Note on Related-Tweakey Impossible Differential Attacks</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Xavier</forename>
                    <surname>Bonnetain</surname>
                  </persName>
                  <email type="md5">aaf3eada80d67f9b81dde2e56e545bba</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="numeric">1023884</idno>
                  <idno type="halauthorid" notation="string">1089379-1023884</idno>
                  <idno type="IDREF">https://www.idref.fr/245285385</idno>
                  <affiliation ref="#struct-450090"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Virginie</forename>
                    <surname>Lallemand</surname>
                  </persName>
                  <email type="md5">bc45d5e7c065fcfbeb25cf2c80a35762</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">virginie-lallemand</idno>
                  <idno type="idhal" notation="numeric">739455</idno>
                  <idno type="halauthorid" notation="string">42693-739455</idno>
                  <idno type="IDREF">https://www.idref.fr/203634438</idno>
                  <affiliation ref="#struct-450090"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">858698</idno>
                <idno type="issn">3006-5496</idno>
                <title level="j">IACR Communications in Cryptology</title>
                <imprint>
                  <publisher>International Association for Cryptologic Research (IACR)</publisher>
                  <biblScope unit="volume">1</biblScope>
                  <biblScope unit="issue">3</biblScope>
                  <date type="datePub">2024-10-07</date>
                </imprint>
              </monogr>
              <idno type="doi">10.62056/abbn-4c2h</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Complexity Analysis</term>
                <term xml:lang="en">Related-Tweakey</term>
                <term xml:lang="en">Impossible Differential Attack</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-cr">Computer Science [cs]/Cryptography and Security [cs.CR]</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>In this note we review the technique proposed at ToSC 2018 by Sadeghi et al. for attacks built upon several related-tweakey impossible differential trails. We show that the initial encryption queries are improper and lead the authors to misevaluate a filtering value in the key recovery phase. We identified 4 other papers (from Eurocrypt, DCC, and 2 from ToSC) that follow on the results of Sadeghi et al., and in three of them the flawed technique was reused.We thus present a careful analysis of these types of attacks and give generic complexity formulas similar to the ones proposed by Boura et al. at Asiacrypt 2014. We apply these to the aforementioned papers and provide patched versions of their attacks. The main consequence is an increase in the memory complexity. We show that in many cases (a notable exception being quantum impossible differentials) it is possible to recover the numeric time estimates of the flawed analysis, and in all cases we were able to build a correct attack reaching the same number of rounds.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-450090" status="VALID">
          <idno type="RNSR">201622054G</idno>
          <idno type="ROR">https://ror.org/034kszc22</idno>
          <orgName>Cryptology, arithmetic : algebraic methods for better algorithms</orgName>
          <orgName type="acronym">CARAMBA</orgName>
          <date type="start">2016-01-01</date>
          <date type="end">2024-12-31</date>
          <desc>
            <address>
              <addrLine>615 rue du Jardin Botanique54600 Villers-lès-Nancy</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/caramba</ref>
          </desc>
          <listRelation>
            <relation active="#struct-129671" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-423083" type="direct"/>
            <relation active="#struct-206040" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-129671" status="VALID">
          <idno type="RNSR">198618246Y</idno>
          <idno type="ROR">https://ror.org/03fcjvn64</idno>
          <orgName>Centre Inria de l'Université de Lorraine</orgName>
          <desc>
            <address>
              <addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/nancy</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="department" xml:id="struct-423083" status="VALID">
          <orgName>Department of Algorithms, Computation, Image and Geometry</orgName>
          <orgName type="acronym">LORIA - ALGO</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr/en/research/departments/algorithms-computation-image-and-geometry/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-206040" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-206040" status="VALID">
          <idno type="IdRef">067077927</idno>
          <idno type="ISNI">0000000121795429</idno>
          <idno type="RNSR">198912571S</idno>
          <idno type="IdUnivLorraine">[UL]RSI--</idno>
          <idno type="ROR">https://ror.org/02vnf0c38</idno>
          <orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
          <orgName type="acronym">LORIA</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-413289" type="direct"/>
            <relation name="UMR7503" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-413289" status="VALID">
          <idno type="IdRef">157040569</idno>
          <idno type="IdUnivLorraine">[UL]100--</idno>
          <idno type="ROR">https://ror.org/04vfs2w97</idno>
          <orgName>Université de Lorraine</orgName>
          <orgName type="acronym">UL</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lorraine.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>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-72352" status="VALID">
          <idno type="anr">ANR-22-CE39-0015</idno>
          <orgName>OREO</orgName>
          <desc>Modélisation MILP pour la Cryptographie Symétrique</desc>
          <date type="start">2022</date>
        </org>
        <org type="anrProject" xml:id="projanr-98294" status="VALID">
          <idno type="anr">ANR-22-PECY-0010</idno>
          <orgName>CRYPTANALYSE</orgName>
          <desc>Cryptanalyse de primitives cryptographiques classiques</desc>
          <date type="start">2022</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>