Twisted Gabidulin Codes in the GPT Cryptosystem

06/26/2018
by   Sven Puchinger, et al.
0

In this paper, we investigate twisted Gabidulin codes in the GPT code-based public-key cryptosystem. We show that Overbeck's attack is not feasible for a subfamily of twisted Gabidulin codes. The resulting key sizes are significantly lower than in the original McEliece system and also slightly smaller than in Loidreau's unbroken GPT variant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2019

Cryptanalysis of a System Based on Twisted Reed-Solomon Codes

It was recently proved that twisted Reed--Solomon codes represent a fami...
research
01/11/2018

Repairing the Faure-Loidreau Public-Key Cryptosystem

A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem i...
research
05/31/2020

New Code-Based Cryptosystem with Arbitrary Error Vectors

McEliece cryptosystem represents a smart open key system based on the ha...
research
12/12/2018

On a Rank-Metric Code-Based Cryptosystem with Small Key Size

A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem i...
research
04/27/2020

Nested Tailbiting Convolutional Codes for Secrecy, Privacy, and Storage

A key agreement problem is considered that has a biometric or physical i...
research
05/05/2023

RECIPE: Rateless Erasure Codes Induced by Protocol-Based Encoding

LT (Luby transform) codes are a celebrated family of rateless erasure co...
research
09/16/2023

Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes

This paper develops an algorithmic approach for obtaining approximate, n...

Please sign up or login with your details

Forgot password? Click here to reset