9 citations · 15 across the 5 of their papers we have counts for
5 papers
Cryptanalysis of a code-based full-time signature
Nicolas Aragon, Marco Baldi, Jean-Christophe Deneuville +3
We present an attack against a code-based signature scheme based on the Lyubashevsky protocol that was recently proposed by Song, Huang, Mu, Wu and Wang (SHMWW). The private key in…
A New Path to Code-based Signatures via Identification Schemes with Restricted Errors
Marco Baldi, Massimo Battaglioni, Franco Chiaraluce +4
In this paper we introduce a variant of the Syndrome Decoding Problem (SDP), that we call Restricted SDP (R-SDP), in which the entries of the searched vector are defined over a sub…
On the Hardness of the Lee Syndrome Decoding Problem
Violetta Weger, Karan Khathuria, Anna-Lena Horlemann +3
In this paper we study the hardness of the syndrome decoding problem over finite rings endowed with the Lee metric. We first prove that the decisional version of the problem is NP-…
Information set decoding of Lee-metric codes over finite rings
Violetta Weger, Massimo Battaglioni, Paolo Santini +3
Information set decoding (ISD) algorithms are the best known procedures to solve the decoding problem for general linear codes. These algorithms are hence used for codes without a…
Code-based Key Encapsulation from McEliece's Cryptosystem
Edoardo Persichetti
In this paper we show that it is possible to extend the framework of Persichetti's code-based framework and create a secure KEM based on the McEliece protocol. This provides greate…