DeepAI AI Chat
Log In Sign Up

An analysis of Coggia-Couvreur attack on Loidreau's rank-metric public key encryption scheme in the general case

by   Pierre Loidreau, et al.
Université de Rennes 1

In this paper we show that in the case where the public-key can be distinguished from a random code in Loidreau's encryption scheme, then Coggia-Couvreur attack can be extended to recover an equivalent secret key. This attack can be conducted in polynomial-time if the masking vector space has dimension 3, thus recovering the results of Ghatak.


page 1

page 2

page 3

page 4


On the security of a Loidreau's rank metric code based encryption scheme

We present a polynomial time attack of a rank metric code based encrypti...

Recovering short secret keys of RLCE in polynomial time

We present a key recovery attack against Y. Wang's Random Linear Code En...

Determining the Optimal Random-padding Size for Rabin Cryptosystems

Rabin encryption and a secure ownership transfer protocol based on the d...

A Vector Space Approach to Generate Dynamic Keys for Hill Cipher

In this paper a variant of the Hill cipher is proposed. In the classical...

Extending Coggia-Couvreur Attack on Loidreau's Rank-metric Cryptosystem

A recent paper by Coggia and Couvreur presents a polynomial time key-rec...

On the privacy of a code-based single-server computational PIR scheme

We show that the single-server computational PIR protocol proposed by Ho...

Polynomial-Time Key Recovery Attack on the Lau-Tan Cryptosystem Based on Gabidulin Codes

This paper presents a key recovery attack on the cryptosystem proposed b...