Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes

Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes

The purpose of this paper is to demonstrate that a distinguisher of Reed-Solomon codes based on the square code construction leads to the cryptanalysis of several cryptosystems relying on them. These schemes are respectively (i) a homomorphic encryption scheme proposed by Bogdanov and Lee; (ii) a variation of the McEliece cryptosystem proposed by Baldi et al. which firstly uses ReedSolomon code...

Reaction Attacks against several Public-Key Cryptosystems

We present attacks against the McEliece Public-Key Cryptosystem, the Atjai-Dwork Public-Key Cryptosystem, and variants of those systems. Most of these systems base their security on the apparent intractibility of one or more problems. The attacks we present do not violate the intractibility of the underlying problems, but instead obtain information about the private key or plaintext by watching...

General Fault Attacks on Multivariate Public Key Cryptosystems

General fault attacks on multivariate public key cryptosystems

Comparison of two Public Key Cryptosystems

Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...

Reaction Attacks on Public Key Cryptosystems Based on the Word Problem