activity
20162026
most citedSoft McEliece: MDPC code-based McEliece cryptosystems with very compact keys through real-valued intentional errors

15 citations · 36 across the 21 of their papers we have counts for

collaborators
Showing cs.CRShow all

16 papers · 1 filter

cs.CR2026

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…

cs.CR2026

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…

cs.CR2026

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…

cs.CR2023

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…

cs.CR2022

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…

cs.CR2022

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…

cs.CR2022

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…

cs.CR2022★ 1 cited

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…

cs.CR2020

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…

cs.CR2020★ 9 cited

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…

cs.CR2020★ 3 cited

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…

cs.CR2019

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…

cs.CR2019

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…

cs.CR2018

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…

cs.CR2018★ 3 cited

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…

cs.CR2018

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…