Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis

Maxime Bombar, Alain Couvreur

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This article discusses the decoding of Gabidulin codes and shows how to extend the usual decoder to any supercode of a Gabidulin code at the cost of a significant decrease of the decoding radius. Using this decoder, we provide polynomial time attacks on the rank metric encryption schemes Ramesses and Liga.

Original languageEnglish
Title of host publicationPost-Quantum Cryptography - 12th International Workshop, PQCrypto 2021, Proceedings
EditorsJung Hee Cheon, Jean-Pierre Tillich
PublisherSpringer Science and Business Media Deutschland GmbH
Pages3-22
Number of pages20
ISBN (Print)9783030812928
DOIs
Publication statusPublished - 1 Jan 2021
Event12th International Conference on post-quantum cryptography, PQCrypto 2021 - Daejeon, Korea, Republic of
Duration: 20 Jul 202122 Jul 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12841 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on post-quantum cryptography, PQCrypto 2021
Country/TerritoryKorea, Republic of
CityDaejeon
Period20/07/2122/07/21

Keywords

  • Code–based cryptography
  • Cryptanalysis
  • Decoding
  • Gabidulin codes
  • Rank metric

Fingerprint

Dive into the research topics of 'Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis'. Together they form a unique fingerprint.

Cite this