Skip to Main content Skip to Navigation
Conference papers

Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes

Abstract : 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 Reed-Solomon codes instead of Goppa codes and secondly, adds a rank 1 matrix to the permutation matrix; (iii) Wieschebrink's variant of the McEliece cryptosystem which consists in concatenating a few random columns to a generator matrix of a secretly chosen generalized Reed-Solomon code.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download
Contributor : Alain Couvreur <>
Submitted on : Wednesday, June 5, 2013 - 2:08:36 PM
Last modification on : Wednesday, July 22, 2020 - 9:14:03 AM
Long-term archiving on: : Tuesday, April 4, 2017 - 5:15:30 PM


Files produced by the author(s)


  • HAL Id : hal-00830594, version 1


Alain Couvreur, Philippe Gaborit, Valérie Gautier, Ayoub Otmani, Jean-Pierre Tillich. Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes. International Workshop on Coding and Cryptography - WCC 2013, Apr 2013, Bergen, Norway. pp.181-193. ⟨hal-00830594⟩



Record views


Files downloads