<?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-01957037</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-18T19:04:25+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The decoding failure probability of MDPC codes</title>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Pierre</forename>
                <surname>Tillich</surname>
              </persName>
              <email type="md5">2a26c5d64300a201a6c8062a6ebfd304</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">jean-pierre-tillich</idno>
              <idno type="idhal" notation="numeric">2208</idno>
              <idno type="halauthorid" notation="string">20350-2208</idno>
              <idno type="IDREF">https://www.idref.fr/057174814</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-1709-1792</idno>
              <affiliation ref="#struct-454686"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Jean-Pierre</forename>
                <surname>Tillich</surname>
              </persName>
              <email type="md5">2a26c5d64300a201a6c8062a6ebfd304</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder ref="#projanr-43564"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-12-17 09:05:52</date>
              <date type="whenModified">2025-11-21 08:42:19</date>
              <date type="whenReleased">2018-12-17 10:34:11</date>
              <date type="whenProduced">2018-06-17</date>
              <date type="whenEndEmbargoed">2018-12-17</date>
              <ref type="file" target="https://inria.hal.science/hal-01957037v1/document">
                <date notBefore="2018-12-17"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01957037v1/file/errprob.pdf" id="file-1957037-1981215">
                <date notBefore="2018-12-17"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1801.04668"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="188459">
                <persName>
                  <forename>Jean-Pierre</forename>
                  <surname>Tillich</surname>
                </persName>
                <email type="md5">2a26c5d64300a201a6c8062a6ebfd304</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01957037</idno>
            <idno type="halUri">https://inria.hal.science/hal-01957037</idno>
            <idno type="halBibtex">tillich:hal-01957037</idno>
            <idno type="halRefHtml">&lt;i&gt;ISIT 2018 - IEEE International Symposium on Information Theory&lt;/i&gt;, Jun 2018, Vail, United States. pp.941-945, &lt;a target="_blank" href="https://dx.doi.org/10.1109/ISIT.2018.8437843"&gt;&amp;#x27E8;10.1109/ISIT.2018.8437843&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">ISIT 2018 - IEEE International Symposium on Information Theory, Jun 2018, Vail, United States. pp.941-945, &amp;#x27E8;10.1109/ISIT.2018.8437843&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1957037-1981215"/></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="ANR">ANR</idno>
            <idno type="stamp" n="ANR_QUANTIQUE">ANR QUANTIQUE</idno>
            <idno type="stamp" n="ANR_QUANTIQUE_1" corresp="ANR_QUANTIQUE">ANR_QUANTIQUE_1</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">The decoding failure probability of MDPC codes</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Pierre</forename>
                    <surname>Tillich</surname>
                  </persName>
                  <email type="md5">2a26c5d64300a201a6c8062a6ebfd304</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">jean-pierre-tillich</idno>
                  <idno type="idhal" notation="numeric">2208</idno>
                  <idno type="halauthorid" notation="string">20350-2208</idno>
                  <idno type="IDREF">https://www.idref.fr/057174814</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-1709-1792</idno>
                  <affiliation ref="#struct-454686"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>ISIT 2018 - IEEE International Symposium on Information Theory</title>
                  <date type="start">2018-06-17</date>
                  <settlement>Vail</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">941-945</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.1109/ISIT.2018.8437843</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-it">Computer Science [cs]/Information Theory [cs.IT]</classCode>
              <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>Moderate Density Parity Check (MDPC) codes are defined here as codes which have a parity-check matrix whose row weight is of order the square root of the length n of the code. They can be decoded like LDPC codes but they decode much less errors than LDPC codes: the number of errors they can decode in this case is of order the square root of n. Despite this fact they have been proved very useful in cryptography for devising key exchange mechanisms [BGG + 17]. They have also been proposed in McEliece type cryptosystems. However in this case, the parameters that have been proposed in [MTSB13] were broken in [GJS16]. This attack exploits the fact that the decoding failure probability is non-negligible. We show here that this attack can be thwarted by choosing the parameters in a more conservative way. We first show that such codes can decode with a simple bit-flipping decoder any pattern of O √ n log log n log n errors. This avoids the previous attack at the cost of significantly increasing the key size of the scheme. We then show that under a very reasonable assumptions the error probability after decoding decays almost exponentially with the codelength with just two iterations of bit-flipping. With an additional assumption it has even been proved that it decays exponentially with an unbounded number of iterations and show that in this case the increase of the key size which is required for resisting to the [GJS16] attack is only moderate.</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-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>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-43564" status="VALID">
          <idno type="anr">ANR-17-CE39-0007</idno>
          <orgName>CBCRYPT</orgName>
          <desc>Cryptographie basée sur les codes</desc>
          <date type="start">2017</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>