Franco Chiaraluce
YOU?
Author Swipe
View article: Distance Properties of Punctured Simplex Codes and Design of High-Rate PRC-LDPC Codes for Complexity-Constrained Applications
Distance Properties of Punctured Simplex Codes and Design of High-Rate PRC-LDPC Codes for Complexity-Constrained Applications Open
Cyclic simplex codes are usually deemed as impractical because of their extremely low rate and large codeword length for practical values of the code dimension. To address these limitations, researchers have resorted to punctured simplex c…
View article: BF-Max: an Efficient Bit Flipping Decoder with Predictable Decoding Failure Rate
BF-Max: an Efficient Bit Flipping Decoder with Predictable Decoding Failure Rate Open
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 codes in which, ultimately, decryption boils down to syndrome d…
View article: Machine Learning-Based Tail Sequence Detection in LDPC-Coded Space Transmissions
Machine Learning-Based Tail Sequence Detection in LDPC-Coded Space Transmissions Open
In the context of space communications, as per the recommendation from the Consultative Committee for Space Data Systems regarding TeleCommand synchronization and coding, the Communications Link Transmission Unit is composed of a start seq…
View article: Telecommand Rejection Probability in CCSDS-Compliant LDPC-Coded Space Transmissions With Tail Sequence
Telecommand Rejection Probability in CCSDS-Compliant LDPC-Coded Space Transmissions With Tail Sequence Open
According to the Consultative Committee for Space Data Systems (CCSDS) recommendation for Telecommand (TC) synchronization and coding, the Communications Link Transmission Unit (CLTU) consists of a start sequence, followed by coded data, a…
View article: A new path to code-based signatures via identification schemes with restricted errors
A new path to code-based signatures via identification schemes with restricted errors Open
In this paper, we introduce a new variant of the syndrome decoding problem (SDP), called restricted SDP (R-SDP), in which the entries of the solution vector live in a fixed subset of the underlying finite field. We prove the NP-completenes…
View article: Decentralized Biometric Authentication based on Fuzzy Commitments and Blockchain
Decentralized Biometric Authentication based on Fuzzy Commitments and Blockchain Open
Blockchain technology, which was introduced for supporting cryptocurrencies, today provides a decentralized in- frastructure for general information storage and execution of algorithms, thus enabling the conversion of many applications and…
View article: BiometricIdentity dApp: Decentralized biometric authentication based on fuzzy commitment and blockchain
BiometricIdentity dApp: Decentralized biometric authentication based on fuzzy commitment and blockchain Open
As biometric authentication has been increasingly integrated into cutting-edge technology, it is interesting to study how its level of trust and interoperability across multiple devices can be increased. They can actually be enhanced throu…
View article: Decentralized Biometric Authentication based on Fuzzy Commitments and Blockchain
Decentralized Biometric Authentication based on Fuzzy Commitments and Blockchain Open
Blockchain technology, which was introduced for supporting cryptocurrencies, today provides a decentralized infrastructure for general information storage and execution of algorithms, thus enabling the conversion of many applications and s…
View article: Rate-Compatible LDPC Codes Based on Primitive Polynomials and Golomb Rulers
Rate-Compatible LDPC Codes Based on Primitive Polynomials and Golomb Rulers Open
We introduce and study a family of rate-compatible Low-Density Parity-Check (LDPC) codes. The design of these codes starts from simplex codes, defined by parity-check matrices having a simple form stemming from the coefficients of a primit…
View article: Bounds on the Free Distance of Periodically Time-Varying SC-LDPC Codes
Bounds on the Free Distance of Periodically Time-Varying SC-LDPC Codes Open
Time-invariant spatially coupled low-density parity-check (TI-SC-LDPC) codes can be obtained by unwrapping quasi-cyclic (QC) LDPC codes. This results in a free distance that is lower bounded by the minimum distance of the underlying QC-LDP…
View article: Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems
Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems Open
The Permuted Kernel Problem (PKP) asks to find a permutation which maps an input matrix into the kernel of some given vector space. The literature exhibits several works studying its hardness in the case of the input matrix being mono-dime…
View article: SPANSE: Combining sparsity with density for efficient one-time code-based digital signatures
SPANSE: Combining sparsity with density for efficient one-time code-based digital signatures Open
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 encryption schemes, as also witnessed by the ongoing NIST p…
View article: Rate-compatible LDPC Codes based on Primitive Polynomials and Golomb Rulers
Rate-compatible LDPC Codes based on Primitive Polynomials and Golomb Rulers Open
We introduce and study a family of rate-compatible Low-Density Parity-Check (LDPC) codes characterized by very simple encoders. The design of these codes starts from simplex codes, which are defined by parity-check matrices having a straig…
View article: Optimizing quasi-cyclic spatially coupled LDPC codes by eliminating harmful objects
Optimizing quasi-cyclic spatially coupled LDPC codes by eliminating harmful objects Open
It is well known that some harmful objects in the Tanner graph of low-density parity-check (LDPC) codes have a negative impact on their error correction performance under iterative message-passing decoding. Depending on the channel and the…
View article: A Novel Attack to the Permuted Kernel Problem
A Novel Attack to the Permuted Kernel Problem Open
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 signature scheme deriving from the identification scheme proposed …
View article: Implementation of Ethereum Accounts and Transactions on Embedded IoT Devices
Implementation of Ethereum Accounts and Transactions on Embedded IoT Devices Open
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 and collected by embedded devices. The blockchain and distri…
View article: MAGIC: A Method for Assessing Cyber Incidents Occurrence
MAGIC: A Method for Assessing Cyber Incidents Occurrence Open
The assessment of cyber risk plays a crucial role for cybersecurity management, and has become a compulsory task for certain types of companies and organizations. This makes the demand for reliable cyber risk assessment tools continuously …
View article: SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
SPANSE: combining sparsity with density for efficient one-time code-based digital signatures Open
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 encryption schemes, as also witnessed by the ongoing NIST p…
View article: Analysis of a blockchain protocol based on LDPC codes
Analysis of a blockchain protocol based on LDPC codes Open
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, which can download and store the full blockchain, are aware …
View article: Optimization of a Reed-Solomon code-based protocol against blockchain data availability attacks
Optimization of a Reed-Solomon code-based protocol against blockchain data availability attacks Open
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 encode the list of transactions and a random sampling phase wh…
View article: MAGIC: A Method for Assessing Cyber Incidents Occurrence
MAGIC: A Method for Assessing Cyber Incidents Occurrence Open
The assessment of cyber risk plays a crucial role for cybersecurity management, and has become a compulsory task for certain types of companies and organizations. This makes the demand for reliable cyber risk assessment tools continuously …
View article: Next generation earth-to-space telecommand coding and synchronization: ground system design, optimization and software implementation
Next generation earth-to-space telecommand coding and synchronization: ground system design, optimization and software implementation Open
The Consultative Committee for Space Data Systems, followed by all national and international space agencies, has updated the Telecommand Coding and Synchronization sublayer to introduce new powerful low-density parity-check (LDPC) codes. …
View article: Effect of randomizers on the power spectrum excess of space telemetry signals
Effect of randomizers on the power spectrum excess of space telemetry signals Open
Summary This paper presents a thorough analysis of the spectral characteristics of space telemetry signals when randomizers are used to counter the power excess, that is, the increase of the power spectrum in some measurement bandwidths wi…
View article: Girth Analysis and Design of Periodically Time-Varying SC-LDPC Codes
Girth Analysis and Design of Periodically Time-Varying SC-LDPC Codes Open
Time-varying spatially coupled low-density parity-check (SC-LDPC) codes with very large period are characterized by significantly better error rate performance and girth properties than their time-invariant counterparts, but the number of …
View article: Dataset related to "Girth analysis and design of periodically time-varying SC-LDPC codes"
Dataset related to "Girth analysis and design of periodically time-varying SC-LDPC codes" Open
This archive contains the parity-check matrices of the codes considered in the paper "Girth analysis and design of periodically time-varying SC-LDPC codes". Two representations are given: the exponent matrix in time-varying form and the tr…
View article: Dataset related to "Girth analysis and design of periodically time-varying SC-LDPC codes"
Dataset related to "Girth analysis and design of periodically time-varying SC-LDPC codes" Open
This archive contains the parity-check matrices of the codes considered in the paper "Girth analysis and design of periodically time-varying SC-LDPC codes". Two representations are given: the exponent matrix in time-varying form and the tr…
View article: Efficient Hardware Implementation of the LEDAcrypt Decoder
Efficient Hardware Implementation of the LEDAcrypt Decoder Open
This work describes an efficient implementation of the iterative decoder that is the main part of the decryption stage in the LEDAcrypt cryptosystem, recently proposed for post-quantum cryptography based on low-density parity-check (LDPC) …
View article: A New Path to Code-based Signatures via Identification Schemes with Restricted Errors
A New Path to Code-based Signatures via Identification Schemes with Restricted Errors Open
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 subset of the underlying finite field. We prove the NP-complet…