Complexity of statistical attacks on QC-LDPC code-based cryptosystems
Gespeichert in:
| Titel: | Complexity of statistical attacks on QC-LDPC code-based cryptosystems |
|---|---|
| Autoren: | SANTINI, PAOLO, Baldi, Marco, Chiaraluce, Franco |
| Weitere Verfasser: | Santini, Paolo, Baldi, Marco, Chiaraluce, Franco |
| Publikationsjahr: | 2020 |
| Bestand: | Università Politecnica delle Marche: IRIS |
| Schlagwörter: | Code-based cryptosystems, cryptanalyis, post-quantum cryptography, QC-LDPC codes, statistical attacks |
| Beschreibung: | Public-key cryptosystems built on quasi-cyclic (QC) low-density parity-check and moderate-density parity-check codes are promising candidates for post-quantum cryptography, since they are characterised by compact keys and high algorithmic efficiency. The main issue with this kind of system is represented by the fact that, since the decoding procedure is probabilistic, it may leak information about the secret key. In this work, the authors study cryptanalysis procedures that aim at recovering the secret key by exploiting this fact. They identify the phenomenon that is at the basis of these procedures and show that the QC structure plays an important role in the success of these attacks. They use a graph analogy to study the complexity of these attacks, and show that their feasibility strongly depends on the QC structure. They also devise an approach to perform full cryptanalysis by combining an information set decoding algorithm with some partial knowledge about the structure of the secret key. |
| Publikationsart: | article in journal/newspaper |
| Dateibeschreibung: | ELETTRONICO |
| Sprache: | English |
| Relation: | info:eu-repo/semantics/altIdentifier/wos/WOS:000561335400005; volume:14; issue:3; firstpage:304; lastpage:312; numberofpages:9; journal:IET INFORMATION SECURITY; https://hdl.handle.net/11566/271987 |
| DOI: | 10.1049/iet-ifs.2019.0420 |
| Verfügbarkeit: | https://hdl.handle.net/11566/271987 https://doi.org/10.1049/iet-ifs.2019.0420 |
| Rights: | info:eu-repo/semantics/openAccess ; license:Tutti i diritti riservati ; license:Licenza specifica dell'editore ; license uri:iris.PRI01 ; license uri:iris.PRI02 |
| Dokumentencode: | edsbas.129B368F |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | Public-key cryptosystems built on quasi-cyclic (QC) low-density parity-check and moderate-density parity-check codes are promising candidates for post-quantum cryptography, since they are characterised by compact keys and high algorithmic efficiency. The main issue with this kind of system is represented by the fact that, since the decoding procedure is probabilistic, it may leak information about the secret key. In this work, the authors study cryptanalysis procedures that aim at recovering the secret key by exploiting this fact. They identify the phenomenon that is at the basis of these procedures and show that the QC structure plays an important role in the success of these attacks. They use a graph analogy to study the complexity of these attacks, and show that their feasibility strongly depends on the QC structure. They also devise an approach to perform full cryptanalysis by combining an information set decoding algorithm with some partial knowledge about the structure of the secret key. |
|---|---|
| DOI: | 10.1049/iet-ifs.2019.0420 |