15 citations · 36 across the 21 of their papers we have counts for
24 papers
Efficient and Quantum-safe Internet Key Exchange Protocols for Satellite Communications
Davide De Zuane, Marco Baldi, Paolo Santini +4
This paper studies cryptographic key exchange in satellite communications, which requires specific solutions because the satellite context presents unique challenges, particularly…
The Power of Power Codes: New Classes of Easy Instances for the Linear Equivalence Problem
Michele Battagliola, Anna-Lena Horlemann, Abhinaba Mazumder +4
Given two linear codes, the Linear Equivalence Problem (LEP) asks to find (if it exists) a linear isometry between them; as a special case, we have the Permutation Equivalence Prob…
Near-Codewords Aware Bit Flipping Decoding of QC-MDPC Codes
Alessio Baldelli, Marco Baldi, Davide De Zuane +1
Bit-Flipping (BF) decoders are a family of decoders widely employed in post-quantum cryptographic schemes based on Quasi-Cyclic Moderate-Density Parity-Check (QC-MDPC) codes, such…
Implementation and transition to post-quantum cryptography of the Minimal IKE protocol
Davide De Zuane, Paolo Santini, Marco Baldi
This paper concerns the Minimal Internet Key Exchange (IKE) protocol, which has received little attention to date, despite its potential to make the best-known IKE protocol suffici…
BF-Max: an Efficient Bit Flipping Decoder with Predictable Decoding Failure Rate
Alessio Baldelli, Marco Baldi, Franco Chiaraluce +1
The Bit-Flipping (BF) decoder, thanks to its very low computational complexity, is widely employed in post-quantum cryptographic schemes based on Moderate Density Parity Check code…
Generic Decoding of Restricted Errors
Marco Baldi, Sebastian Bitzer, Alessio Pavoni +3
Several recently proposed code-based cryptosystems base their security on a slightly generalized version of the classical (syndrome) decoding problem. Namely, in the so-called rest…
Implementation of Ethereum Accounts and Transactions on Embedded IoT Devices
Giulia Rafaiani, Paolo Santini, Marco Baldi +1
The growing interest in Internet of Things (IoT) and Industrial IoT (IIoT) poses the challenge of finding robust solutions for the certification and notarization of data produced a…
A Novel Attack to the Permuted Kernel Problem
Paolo Santini, Marco Baldi, Franco Chiaraluce
The Permuted Kernel Problem (PKP) asks to find a permutation of a given vector belonging to the kernel of a given matrix. The PKP is at the basis of PKP-DSS, a post-quantum signatu…
SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
Marco Baldi, Franco Chiaraluce, Paolo Santini
The use of codes defined by sparse characteristic matrices, like QC-LDPC and QC-MDPC codes, has become an established solution to design secure and efficient code-based public-key…
Analysis of a blockchain protocol based on LDPC codes
Massimo Battaglioni, Paolo Santini, Giulia Rafaiani +2
In a blockchain Data Availability Attack (DAA), a malicious node publishes a block header but withholds part of the block, which contains invalid transactions. Honest full nodes, w…
Optimization of a Reed-Solomon code-based protocol against blockchain data availability attacks
Paolo Santini, Giulia Rafaiani, Massimo Battaglioni +2
ASBK (named after the authors' initials) is a recent blockchain protocol tackling data availability attacks against light nodes, employing two-dimensional Reed-Solomon codes to enc…
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…
A Code-specific Conservative Model for the Failure Rate of Bit-flipping Decoding of LDPC Codes with Cryptographic Applications
Paolo Santini, Alessandro Barenghi, Gerardo Pelosi +2
Characterizing the decoding failure rate of iteratively decoded Low- and Moderate-Density Parity Check (LDPC/MDPC) codes is paramount to build cryptosystems based on them, able to…
Analysis of the error correction capability of LDPC and MDPC codes under parallel bit-flipping decoding and application to cryptography
Paolo Santini, Massimo Battaglioni, Marco Baldi +1
Iterative decoders used for decoding low-density parity-check (LDPC) and moderate-density parity-check (MDPC) codes are not characterized by a deterministic decoding radius and the…
Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes
Paolo Santini, Massimo Battaglioni, Franco Chiaraluce +1
In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-check codes, which encompass low-density parity-check (LDPC) codes and moderate-dens…
Cryptanalysis of a One-Time Code-Based Digital Signature Scheme
Paolo Santini, Marco Baldi, Franco Chiaraluce
We consider a one-time digital signature scheme recently proposed by Persichetti and show that a successful key recovery attack can be mounted with limited complexity. The attack w…
Assessing and countering reaction attacks against post-quantum public-key cryptosystems based on QC-LDPC codes
Paolo Santini, Marco Baldi, Franco Chiaraluce
Code-based public-key cryptosystems based on QC-LDPC and QC-MDPC codes are promising post-quantum candidates to replace quantum vulnerable classical alternatives. However, a new ty…
Design and Implementation of a Digital Signature Scheme Based on Low-density Generator Matrix Codes
Marco Baldi, Alessandro Barenghi, Franco Chiaraluce +4
In this paper we consider a post-quantum digital signature scheme based on low-density generator matrix codes and propose efficient algorithmic solutions for its implementation. We…
Hindering reaction attacks by using monomial codes in the McEliece cryptosystem
Paolo Santini, Marco Baldi, Giovanni Cancellieri +1
In this paper we study recent reaction attacks against QC-LDPC and QC-MDPC code-based cryptosystems, which allow an opponent to recover the private parity-check matrix through its…
LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
Marco Baldi, Alessandro Barenghi, Franco Chiaraluce +2
This work presents a new code-based key encapsulation mechanism (KEM) called LEDAkem. It is built on the Niederreiter cryptosystem and relies on quasi-cyclic low-density parity-che…
Soft McEliece: MDPC code-based McEliece cryptosystems with very compact keys through real-valued intentional errors
Marco Baldi, Paolo Santini, Franco Chiaraluce
We propose to use real-valued errors instead of classical bit flipping intentional errors in the McEliece cryptosystem based on moderate-density parity-check (MDPC) codes. This all…