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

12/23/2021
by   Pierre Loidreau, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2019

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...
research
05/29/2018

Recovering short secret keys of RLCE in polynomial time

We present a key recovery attack against Y. Wang's Random Linear Code En...
research
07/16/2018

Determining the Optimal Random-padding Size for Rabin Cryptosystems

Rabin encryption and a secure ownership transfer protocol based on the d...
research
09/15/2019

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...
research
07/14/2020

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

A recent paper by Coggia and Couvreur presents a polynomial time key-rec...
research
08/24/2019

An Attack on the the Encryption Scheme of the Moscow Internet Voting System

The next Moscow City Duma elections will be held on September 8th with a...
research
04/01/2020

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

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

Please sign up or login with your details

Forgot password? Click here to reset