Interleaving Loidreau's Rank-Metric Cryptosystem

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

6 Scopus citations

Abstract

We propose and analyze an interleaved variant of Loidreau's rank-metric cryptosystem based on rank multipliers. We analyze and adapt several attacks on the system, propose design rules, and study weak keys. Finding secure instances requires near-MRD rank-metric codes which are not investigated in the literature. Thus, we propose a random code construction that makes use of the fact that short random codes over large fields are MRD with high probability. We derive an upper bound on the decryption failure rate and give example parameters for potential key size reduction.

Original languageEnglish
Title of host publication2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages127-132
Number of pages6
ISBN (Electronic)9781728119441
DOIs
StatePublished - Oct 2019
Event16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019 - Moscow, Russian Federation
Duration: 21 Oct 201925 Oct 2019

Publication series

Name2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019

Conference

Conference16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
Country/TerritoryRussian Federation
CityMoscow
Period21/10/1925/10/19

Keywords

  • Code-Based Cryptography
  • Gabidulin Codes
  • Interleaved Codes
  • Rank-Metric Codes

Fingerprint

Dive into the research topics of 'Interleaving Loidreau's Rank-Metric Cryptosystem'. Together they form a unique fingerprint.

Cite this