M
Marco Bianchi
Researcher at Marche Polytechnic University
Publications - Â 23
Citations - Â 549
Marco Bianchi is an academic researcher from Marche Polytechnic University. The author has contributed to research in topics: Low-density parity-check code & McEliece cryptosystem. The author has an hindex of 12, co-authored 23 publications receiving 515 citations. Previous affiliations of Marco Bianchi include University of Zurich.
Papers
More filters
Journal ArticleDOI
Coding With Scrambling, Concatenation, and HARQ for the AWGN Wire-Tap Channel: A Security Gap Analysis
TL;DR: While Eve's channel has a quality equal to or better than that of Bob's channel, it is shown that the use of a hybrid automatic repeat-request protocol with authentication still allows achieving a sufficient level of security.
Journal ArticleDOI
Enhanced Public Key Security for the McEliece Cryptosystem
TL;DR: This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the public key is no longer permutation equivalent to the secret code, thus opening the way for reconsidering the adoption of classical families of codes, like Reed–Solomon codes, that have been longly excluded from the Mceliece Cryptosystem for security reasons.
Proceedings ArticleDOI
Non-systematic codes for physical layer security
TL;DR: In this article, the authors show that the security gap can be further reduced by using non-systematic codes, able to scramble information bits within the transmitted codeword, in such a way that an unauthorized receiver, experiencing a channel different from that of the authorized receiver, is not able to gather any information.
Proceedings ArticleDOI
Optimization of the parity-check matrix density in QC-LDPC code-based McEliece cryptosystems
TL;DR: This paper proposes a procedure for selecting the density of the private parity-check matrix, based on the security level and the decryption complexity, and provides some examples of the system parameters obtained through the proposed technique.
Posted Content
Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures
TL;DR: The proposed scheme exploits sparse syndromes and randomly designed low-density generator matrix codes to achieve considerable security levels with very small public keys.