<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-1643</article-id>
      <title-group>
        <article-title>Security issues of CFS-like digital signature algorithms</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>D’Alconzo</surname>
            <given-names>Giuseppe</given-names>
          </name>
          <aff>Department of Mathematical Sciences, Corso Duca degli Abruzzi 24, Politecnico di Torino, Torino, 10129, Italy</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Meneghetti</surname>
            <given-names>Alessio</given-names>
          </name>
          <aff>Department of Mathematics, Universitá di Trento, Via Sommarive 14, Povo (Trento), 38123, Italy</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Piasenti</surname>
            <given-names>Paolo</given-names>
          </name>
          <aff>Department of Mathematics, Universitá di Trento, Via Sommarive 14, Povo (Trento), 38123, Italy</aff>
        </contrib>
      </contrib-group>
      <volume>27</volume>
      <issue>1</issue>
      <fpage>175</fpage>
      <lpage>187</lpage>
      <pub-date date-type="pub">
        <day>24</day>
        <month>01</month>
        <year>2024</year>
      </pub-date>
      <abstract>
        <p>We analyze the security of some variants of the CFS code-based digital signature scheme. We show how the adoption of some code-based hash functions to improve the efficiency of CFS leads to the ability of an attacker to produce a forgery compatible with the rightful user’s public key.</p>
      </abstract>
      <kwd-group>
        <kwd>Code-based digital signatures</kwd>
        <kwd>CFS</kwd>
        <kwd>Post-quantum cryptography</kwd>
        <kwd>Cryptanalysis</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
