2018/05/12 by P. Santini, Marco Baldi, Santini, Paolo +5
Biochemistry, Genetics and Molecular Biology · Computer Science · #Coding theory and cryptography #Cryptography and Security (cs.CR) #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.1805.04722
openalex publication_date 2018/05/12 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28
In this paper we study recent reaction attacks against QC-LDPC and QC-MDPC\ncode-based cryptosystems, which allow an opponent to recover the private\nparity-check matrix through its distance spectrum by observing a sufficiently\nhigh number of decryption failures. We consider a special class of codes, known\nas monomial codes, to form private keys with the desirable property of having a\nunique and complete distance spectrum. We verify that for these codes the\nproblem of recovering the secret key from the distance spectrum is equivalent\nto that of finding cliques in a graph, and use this equivalence to prove that\ncurrent reaction attacks are not applicable when codes of this type are used in\nthe McEliece cryptosystem.\n