Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes
, 2019 In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-check codes, which encompass low-density parity-check (LDPC) codes and moderate-density parity-check (MDPC) codes.
A Becker +16 more
core +1 more source
Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems [PDF]
, 2011 The Code Equivalence problem is that of determining whether two given linear codes are equivalent to each other up to a permutation of the coordinates.
Dinh, Hang +2 more
core
A Smart Approach for GPT Cryptosystem Based on Rank Codes
, 2010 The concept of Public- key cryptosystem was innovated by McEliece's cryptosystem. The public key cryptosystem based on rank codes was presented in 1991 by Gabidulin -Paramonov-Trejtakov(GPT).
Gabidulin, Ernst M. +2 more
core +1 more source
New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem
, 2015 We consider the decoding problem or the problem of finding low weight codewords for rank metric codes. We show how additional information about the codeword we want to find under the form of certain linear combinations of the entries of the codeword ...
Hauteville, Adrien, Tillich, Jean-Pierre
core +3 more sources
McEliece cryptosystem based on Plotkin construction with QC-MDPC and QC-LDPC codes [PDF]
, 2022 Belkacem Imine +2 more
openalex +1 more source
A New Technique in Rank Metric Code-Based Encryption
Cryptography, 2018 We propose a rank metric codes based encryption based on the hard problem of rank syndrome decoding problem. We propose a new encryption with a public key matrix by considering the adding of a random distortion matrix over F q m of full column ...
Terry Shue Chien Lau, Chik How Tan
doaj +1 more source
A Distinguisher-Based Attack of a Homomorphic Encryption Scheme Relying on Reed-Solomon Codes [PDF]
, 2012 Bogdanov and Lee suggested a homomorphic public-key encryption scheme based on error correcting codes. The underlying public code is a modified Reed-Solomon code obtained from inserting a zero submatrix in the Vandermonde generating matrix defining it ...
Gauthier, Valérie +2 more
core +2 more sources
Information rate of McEliece's public-key cryptosystem [PDF]
Electronics Letters, 1990 We encode messages into the error vectors in McElieces's public-key cryptosystem so that its information rate can be significantly increased, and yet do not reduce its security.
Lin, M.-C., Chang, T.-C., Fu, H.-L.
openaire +1 more source
McEliece public key cryptosystem attack algorithm based on enumeration error vector
Tongxin xuebao, 2014 The research on the security of McEliece (M) public key cryptosystem was presented. The Hamming weight of error vector is less than the code length, and M public key cryptosystem based on Goppa code possesses low weight public code words. Considering the
Jing-mei LIU +3 more
doaj +2 more sources
Compact McEliece keys based on quasi-dyadic Srivastava codes
Journal of Mathematical Cryptology, 2012 The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very large keys, hence recent research has focused mainly on trying to reduce the
Persichetti Edoardo
doaj +1 more source