15 citations · 36 across the 21 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…
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-…
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…
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…
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…