Results 41 to 50 of about 86 (81)
Leaky McEliece: Secret Key Recovery From Highly Erroneous Side-Channel Information
The McEliece cryptosystem is a strong contender for post-quantum schemes, including key encapsulation for confidentiality of key exchanges in network protocols.
Marcus Brinkmann +4 more
doaj +1 more source
Reducing Key Length of the McEliece Cryptosystem [PDF]
The McEliece cryptosystem is one of the oldest public-key cryptosystems ever designed. It is also the first public-key cryptosystem based on linear error-correcting codes. Its main advantage is to have very fast encryption and decryption functions. However it suffers from a major drawback.
Thierry P. Berger +3 more
openaire +1 more source
A New Technique in Rank Metric Code-Based Encryption
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
Information rate of McEliece's public-key cryptosystem [PDF]
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
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
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
Codes in Dihedral Group Algebra
Robert McEliece developed an asymmetric encryption algorithm based on the use of binary Goppa codes in 1978 and no effective key attacks has been described yet.
Kirill V. Vedenev, Vladimir M. Deundyak
doaj +1 more source
On the McEliece Public-Key Cryptosystem [PDF]
Based on an idea by Hin, the method of obtaining the original message after selecting k of n coordinates at random in the McEliece public-key cryptosystem is improved. The attack, which is more efficient than the attacks previously proposed, is characterized by a systematic method of checking and by a random bit swapping procedure.
openaire +1 more source
Efficient ASIC Architecture for Low Latency Classic McEliece Decoding
Post-quantum cryptography addresses the increasing threat that quantum computing poses to modern communication systems. Among the available “quantum-resistant” systems, the Classic McEliece key encapsulation mechanism (KEM) is positioned as a ...
Daniel Fallnich +3 more
doaj +1 more source
Differential Power Analysis of a McEliece Cryptosystem [PDF]
This work presents the first differential power analysis of an implementation of the McEliece cryptosystem. Target of this side-channel attack is a state-of-the-art FPGA implementation of the efficient QC-MDPC McEliece decryption operation as presented at DATE 2014.
Chen, Cong +3 more
openaire +1 more source

