4 citations · 8 across the 6 of their papers we have counts for
6 papers
Threshold Selection for Iterative Decoding of -regular Binary Codes
Alessandro Annechini, Alessandro Barenghi, Gerardo Pelosi
Iterative bit flipping decoders are an efficient and effective decoder choice for decoding codes which admit a sparse parity-check matrix. Among these, sparse -regular codes…
Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding
Alessandro Annechini, Alessandro Barenghi, Gerardo Pelosi
Providing closed-form estimates of the decoding failure rate of iterative decoders for low- and moderate-density binary parity-check codes has attracted significant interest in the…
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…
Systematic Parsing of X.509: Eradicating Security Issues with a Parse Tree
Alessandro Barenghi, Nicholas Mainardi, Gerardo Pelosi
X.509 certificate parsing and validation is a critical task which has shown consistent lack of effectiveness, with practical attacks being reported with a steady rate during the la…
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…
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…