MinRank Gabidulin encryption scheme on matrix codes

DOI10.1007/978-981-96-0894-2_3MaRDI QIDQ6965248zbMATH OpenFDO

Authors Nicolas Aragon, Alain Couvreur, Victor Dyseryn, Philippe Gaborit, Adrien Vinçotte

Publication date 3 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-0894-2_3

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Bilinear forms over a finite field, with applications to coding theory
• Column scrambler for the GPT cryptosystem
• Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
• scientific article; zbMATH DE number 1583768 (Why is no real title available?)
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• Modified GPT PKC with right scrambler
• Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
• Progress in Cryptology – Mycrypt 2005
• Rank-metric codes and their applications
• Rank-metric codes and their duality theory
• Refined F5 Algorithms for Ideals of Minors of Square Matrices
• Severely denting the Gabidulin version of the McEliece public key cryptosystem
• Structural attacks for public key cryptosystems based on Gabidulin codes
• The security of the Gabidulin public key cryptosystem
• Theory of codes with maximum rank distance

Cited in

(3)

• Key attack on the ACDGV matrix encryption scheme
• A minrank-based encryption scheme à la Alekhnovich-Regev
• Linearized polynomial Chinese remainder codes

This page was built for publication: MinRank Gabidulin encryption scheme on matrix codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965248)