<?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-00846041v6</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-21T17:10:53+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case</title>
            <author role="aut">
              <persName>
                <forename type="first">Jérémy</forename>
                <surname>Berthomieu</surname>
              </persName>
              <email type="md5">09bd81d4ebd85c4d234adfe6aec507b4</email>
              <email type="domain">lix.polytechnique.fr</email>
              <idno type="idhal" notation="string">jeremy-berthomieu</idno>
              <idno type="idhal" notation="numeric">3844</idno>
              <idno type="halauthorid" notation="string">18640-3844</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9011-2211</idno>
              <idno type="IDREF">https://www.idref.fr/163559457</idno>
              <orgName ref="#struct-93591"/>
              <affiliation ref="#struct-179805"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Charles</forename>
                <surname>Faugère</surname>
              </persName>
              <email type="md5">424972c8b3e59f15dec87335bdbaf554</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">faugere</idno>
              <idno type="idhal" notation="numeric">19366</idno>
              <idno type="halauthorid" notation="string">2141-19366</idno>
              <idno type="IDREF">https://www.idref.fr/090173449</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/COI-0285-2022</idno>
              <affiliation ref="#struct-179805"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Ludovic</forename>
                <surname>Perret</surname>
              </persName>
              <email type="md5">d1e76a35cfabf006008b7e9391c5bc7d</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="numeric">935330</idno>
              <idno type="halauthorid" notation="string">143637-935330</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/JPN-3539-2023</idno>
              <idno type="ISNI">http://isni.org/isni/0000000359243421</idno>
              <idno type="VIAF">https://viaf.org/viaf/217378925</idno>
              <idno type="IDREF">https://www.idref.fr/123278864</idno>
              <orgName ref="#struct-93591"/>
              <affiliation ref="#struct-179805"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Jérémy</forename>
                <surname>Berthomieu</surname>
              </persName>
              <email type="md5">ae9490a9b9ff687e2c554fa60f2022fc</email>
              <email type="domain">lip6.fr</email>
            </editor>
            <funder ref="#projanr-15543"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2013-07-18 14:07:50</date>
            </edition>
            <edition n="v2">
              <date type="whenSubmitted">2013-07-24 21:42:51</date>
            </edition>
            <edition n="v3">
              <date type="whenSubmitted">2013-07-25 10:11:36</date>
            </edition>
            <edition n="v4">
              <date type="whenSubmitted">2014-04-04 15:11:30</date>
            </edition>
            <edition n="v5">
              <date type="whenSubmitted">2015-03-30 14:02:16</date>
            </edition>
            <edition n="v6" type="current">
              <date type="whenSubmitted">2015-04-21 15:32:27</date>
              <date type="whenModified">2025-04-01 12:24:11</date>
              <date type="whenReleased">2015-05-29 12:08:10</date>
              <date type="whenProduced">2015-08</date>
              <date type="whenEndEmbargoed">2015-04-21</date>
              <ref type="file" target="https://inria.hal.science/hal-00846041v6/document">
                <date notBefore="2015-04-21"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-00846041v6/file/Final.pdf" id="file-1144390-1226939">
                <date notBefore="2015-04-21"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1307.4974"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="151812">
                <persName>
                  <forename>Jérémy</forename>
                  <surname>Berthomieu</surname>
                </persName>
                <email type="md5">ae9490a9b9ff687e2c554fa60f2022fc</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00846041</idno>
            <idno type="halUri">https://inria.hal.science/hal-00846041</idno>
            <idno type="halBibtex">berthomieu:hal-00846041</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Complexity&lt;/i&gt;, 2015, 31 (4), pp.590--616. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.jco.2015.04.001"&gt;&amp;#x27E8;10.1016/j.jco.2015.04.001&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Complexity, 2015, 31 (4), pp.590--616. &amp;#x27E8;10.1016/j.jco.2015.04.001&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1144390-1226939"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</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="INRIA-ROCQ">INRIA Paris - Rocquencourt</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="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</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">Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jérémy</forename>
                    <surname>Berthomieu</surname>
                  </persName>
                  <email type="md5">09bd81d4ebd85c4d234adfe6aec507b4</email>
                  <email type="domain">lix.polytechnique.fr</email>
                  <idno type="idhal" notation="string">jeremy-berthomieu</idno>
                  <idno type="idhal" notation="numeric">3844</idno>
                  <idno type="halauthorid" notation="string">18640-3844</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9011-2211</idno>
                  <idno type="IDREF">https://www.idref.fr/163559457</idno>
                  <orgName ref="#struct-93591"/>
                  <affiliation ref="#struct-179805"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Charles</forename>
                    <surname>Faugère</surname>
                  </persName>
                  <email type="md5">424972c8b3e59f15dec87335bdbaf554</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">faugere</idno>
                  <idno type="idhal" notation="numeric">19366</idno>
                  <idno type="halauthorid" notation="string">2141-19366</idno>
                  <idno type="IDREF">https://www.idref.fr/090173449</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/COI-0285-2022</idno>
                  <affiliation ref="#struct-179805"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Ludovic</forename>
                    <surname>Perret</surname>
                  </persName>
                  <email type="md5">d1e76a35cfabf006008b7e9391c5bc7d</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="numeric">935330</idno>
                  <idno type="halauthorid" notation="string">143637-935330</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/JPN-3539-2023</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000359243421</idno>
                  <idno type="VIAF">https://viaf.org/viaf/217378925</idno>
                  <idno type="IDREF">https://www.idref.fr/123278864</idno>
                  <orgName ref="#struct-93591"/>
                  <affiliation ref="#struct-179805"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">15267</idno>
                <idno type="issn">0885-064X</idno>
                <idno type="eissn">1090-2708</idno>
                <title level="j">Journal of Complexity</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">31</biblScope>
                  <biblScope unit="issue">4</biblScope>
                  <biblScope unit="pp">590--616</biblScope>
                  <date type="datePub">2015-08</date>
                  <date type="dateEpub">2015-04-12</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1307.4974</idno>
              <idno type="doi">10.1016/j.jco.2015.04.001</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">multivariate cryptography</term>
                <term xml:lang="en">Quadratic forms</term>
                <term xml:lang="en">computer algebra</term>
                <term xml:lang="en">polynomial isomorphism</term>
                <term xml:lang="en">module isomorphism</term>
              </keywords>
              <classCode scheme="classification">MSC 12Y05, 94A60, 68W20, 68W30, 68Q25</classCode>
              <classCode scheme="halDomain" n="info.info-sc">Computer Science [cs]/Symbolic Computation [cs.SC]</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>Let $\mathbf{f}=(f_1,\ldots,f_m)$ and $\mathbf{g}=(g_1,\ldots,g_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x_1,\ldots,x_n]$ ($\mathbb{K}$ being a field). We consider the computational problem of finding -- if any -- an invertible transformation on the variables mapping $\mathbf{f}$ to $\mathbf{g}$. The corresponding equivalence problem is known as {\tt Isomorphism of Polynomials with one Secret} ({\tt IP1S}) and is a fundamental problem in multivariate cryptography. The main result is a randomized polynomial-time algorithm for solving {\tt IP1S} for quadratic instances, a particular case of importance in cryptography and somewhat justifying {\it a posteriori} the fact that {\it Graph Isomorphism} reduces to only cubic instances of {\tt IP1S} (Agrawal and Saxena). To this end, we show that {\tt IP1S} for quadratic polynomials can be reduced to a variant of the classical module isomorphism problem in representation theory, which involves to test the orthogonal simultaneous conjugacy of symmetric matrices. We show that we can essentially {\it linearize} the problem by reducing quadratic-{\tt IP1S} to test the orthogonal simultaneous similarity of symmetric matrices; this latter problem was shown by Chistov, Ivanyos and Karpinski to be equivalent to finding an invertible matrix in the linear space $\mathbb{K}^{n \times n}$ of $n \times n$ matrices over $\mathbb{K}$ and to compute the square root in a matrix algebra. While computing square roots of matrices can be done efficiently using numerical methods, it seems difficult to control the bit complexity of such methods. However, we present exact and polynomial-time algorithms for computing the square root in $\mathbb{K}^{n \times n}$ for various fields (including finite fields). We then consider \#{\tt IP1S}, the counting version of {\tt IP1S} for quadratic instances. In particular, we provide a (complete) characterization of the automorphism group of homogeneous quadratic polynomials. Finally, we also consider the more general {\it Isomorphism of Polynomials} ({\tt IP}) problem where we allow an invertible linear transformation on the variables \emph{and} on the set of polynomials. A randomized polynomial-time algorithm for solving {\tt IP} when \(\mathbf{f}=(x_1^d,\ldots,x_n^d)\) is presented. From an algorithmic point of view, the problem boils down to factoring the determinant of a linear matrix (\emph{i.e.}\ a matrix whose components are linear polynomials). This extends to {\tt IP} a result of Kayal obtained for {\tt PolyProj}.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-179805" status="OLD">
          <idno type="RNSR">201221011R</idno>
          <orgName>Polynomial Systems</orgName>
          <orgName type="acronym">PolSys</orgName>
          <date type="start">2012-01-01</date>
          <date type="end">2015-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/polsys</ref>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
            <relation active="#struct-86790" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.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>
        <org type="laboratory" xml:id="struct-86790" status="OLD">
          <orgName>Inria Paris-Rocquencourt</orgName>
          <date type="end">2016-03-30</date>
          <desc>
            <address>
              <addrLine>INRIA Rocquencourt : Domaine de Voluceau, Rocquencourt B.P. 105 78153 le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris-rocquencourt</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-15543" status="VALID">
          <idno type="anr">ANR-11-BS02-0013</idno>
          <orgName>HPAC</orgName>
          <desc>Calcul Algébrique Haute-Performance</desc>
          <date type="start">2011</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>