A reaction attack against cryptosystems based on LRPC codes
Paper in proceedings, 2019

Rank metric is a very promising research direction for code-based cryptography. In fact, thanks to the high complexity of generic decoding attacks against codes in this metric, it is possible to easily select parameters that yield very small data sizes. In this paper we analyze cryptosystems based on Low-Rank Parity-Check (LRPC) codes, one of the classes of codes that are efficiently decodable in the rank metric. We show how to exploit the decoding failure rate, which is an inherent feature of these codes, to devise a reaction attack aimed at recovering the private key. As a case study, we cryptanalyze the recent McNie submission to NIST’s Post-Quantum Standardization process. Additionally, we provide details of a simple implementation to validate our approach.

Author

Simona Samardjiska

Radboud University

Paolo Santini

Marche Polytechnic University

Edoardo Persichetti

Florida Atlantic University

Gustavo Souza Banegas

Eindhoven University of Technology

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 11774 LNCS 197-216

6th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2019
Santiago de Chile, Chile,

Subject Categories

Telecommunications

Bioinformatics (Computational Biology)

Computer Science

DOI

10.1007/978-3-030-30530-7_10

More information

Latest update

11/25/2019