A reaction attack against cryptosystems based on LRPC codes

Simona Samardjiska, Paolo Santini, Edoardo Persichetti, Gustavo Banegas

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

6 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelProgress in Cryptology – LATINCRYPT 2019 - 6th International Conference on Cryptology and Information Security in Latin America, Proceedings
RedacteurenPeter Schwabe, Nicolas Thériault
Plaats van productieCham
UitgeverijSpringer
Pagina's197-216
Aantal pagina's20
ISBN van elektronische versie978-3-030-30530-7
ISBN van geprinte versie978-3-030-30529-1
DOI's
StatusGepubliceerd - 2019

Publicatie series

NaamLecture Notes in Computer Science
UitgeverijSpringerLink
Volume11774

Vingerafdruk Duik in de onderzoeksthema's van 'A reaction attack against cryptosystems based on LRPC codes'. Samen vormen ze een unieke vingerafdruk.

Citeer dit