The Experts below are selected from a list of 321 Experts worldwide ranked by ideXlab platform

Zhongfeng Wang - One of the best experts on this subject based on the ideXlab platform.

  • ReenCoder design for soft-decision decoding of an (255,239) Reed-Solomon Code
    2006 IEEE International Symposium on Circuits and Systems, 2006
    Co-Authors: A. Vardy, Zhongfeng Wang
    Abstract:

    The most computationally demanding step in soft-decision decoding of RS Codes is bivariate polynomial interpolation. The reencoding and coordinate transformation based technique can significantly reduce the computation complexity of the original interpolation problem, thus making the algebraic soft-decision deCoder practically feasible. In this paper, an implementation of the reencoding and coordinate transformation procedure is presented. The novelties of our design include a fast algorithm to determine the reencoding points, an area efficient erasure-only RS decoding architecture, and an overlapped scheduling of the various procedures required for the reencoding process to reduce the overall latency. The synthesis result shows that the proposed design is sufficiently fast for any existing or developing interpolation architecture

Iwan Duursma - One of the best experts on this subject based on the ideXlab platform.

  • ITA - Low bandwidth repair of the RS(10,4) Reed-Solomon Code
    2017 Information Theory and Applications Workshop (ITA), 2017
    Co-Authors: Iwan Duursma
    Abstract:

    As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon Codes. The use of Reed-Solomon Codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon Code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.

  • Low bandwidth repair of the RS(10,4) Reed-Solomon Code
    2017 Information Theory and Applications Workshop (ITA), 2017
    Co-Authors: Iwan Duursma
    Abstract:

    As an alternative to replication of data blocks, the Hadoop Distributed File System offers the possibility of erasure coding using Reed-Solomon Codes. The use of Reed-Solomon Codes significantly reduces storage overhead but has more expensive failure recovery. Using the shortened Reed-Solomon Code RS(10,4), with 10 data symbols and 4 check symbols, standard erasure repair requires downloading 10 symbols or 80 bits. Known schemes attain a reduced repair bandwidth of 65 or 64 bits. In this paper we present three repair schemes with bandwidth 60, 56 and 54, respectively.

B.g. Evans - One of the best experts on this subject based on the ideXlab platform.

A. Vardy - One of the best experts on this subject based on the ideXlab platform.

  • ReenCoder design for soft-decision decoding of an (255,239) Reed-Solomon Code
    2006 IEEE International Symposium on Circuits and Systems, 2006
    Co-Authors: A. Vardy, Zhongfeng Wang
    Abstract:

    The most computationally demanding step in soft-decision decoding of RS Codes is bivariate polynomial interpolation. The reencoding and coordinate transformation based technique can significantly reduce the computation complexity of the original interpolation problem, thus making the algebraic soft-decision deCoder practically feasible. In this paper, an implementation of the reencoding and coordinate transformation procedure is presented. The novelties of our design include a fast algorithm to determine the reencoding points, an area efficient erasure-only RS decoding architecture, and an overlapped scheduling of the various procedures required for the reencoding process to reduce the overall latency. The synthesis result shows that the proposed design is sufficiently fast for any existing or developing interpolation architecture

Jean-pierre Tillich - One of the best experts on this subject based on the ideXlab platform.

  • Distinguisher-based attacks on public-key cryptosystems using Reed---Solomon Codes
    Designs Codes and Cryptography, 2014
    Co-Authors: Alain Couvreur, Philippe Gaborit, Valérie Gauthier-umaña, Ayoub Otmani, Jean-pierre Tillich
    Abstract:

    Because of their interesting algebraic properties, several authors promote the use of generalized Reed---Solomon Codes in cryptography. Niederreiter was the first to suggest an instantiation of his cryptosystem with them but Sidelnikov and Shestakov showed that this choice is insecure. Wieschebrink proposed a 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. More recently, new schemes appeared which are the homomorphic encryption scheme proposed by Bogdanov and Lee, and a variation of the McEliece cryptosystem proposed by Baldi et al. which hides the generalized Reed---Solomon Code by means of matrices of very low rank. In this work, we show how to mount key-recovery attacks against these public-key encryption schemes. We use the concept of distinguisher which aims at detecting a behavior different from the one that one would expect from a random Code. All the distinguishers we have built are based on the notion of component-wise product of Codes. It results in a powerful tool that is able to recover the secret structure of Codes when they are derived from generalized Reed---Solomon Codes. Lastly, we give an alternative to Sidelnikov and Shestakov attack by building a filtration which enables to completely recover the support and the non-zero scalars defining the secret generalized Reed---Solomon Code.

  • Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes
    arXiv: Cryptography and Security, 2013
    Co-Authors: Alain Couvreur, Philippe Gaborit, Valérie Gauthier-umaña, Ayoub Otmani, Jean-pierre Tillich
    Abstract:

    Because of their interesting algebraic properties, several authors promote the use of generalized Reed-Solomon Codes in cryptography. Niederreiter was the first to suggest an instantiation of his cryptosystem with them but Sidelnikov and Shestakov showed that this choice is insecure. Wieschebrink proposed a 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. More recently, new schemes appeared which are the homomorphic encryption scheme proposed by Bogdanov and Lee, and a variation of the McEliece cryptosystem proposed by Baldi et \textit{al.} which hides the generalized Reed-Solomon Code by means of matrices of very low rank. In this work, we show how to mount key-recovery attacks against these public-key encryption schemes. We use the concept of distinguisher which aims at detecting a behavior different from the one that one would expect from a random Code. All the distinguishers we have built are based on the notion of component-wise product of Codes. It results in a powerful tool that is able to recover the secret structure of Codes when they are derived from generalized Reed-Solomon Codes. Lastly, we give an alternative to Sidelnikov and Shestakov attack by building a filtration which enables to completely recover the support and the non-zero scalars defining the secret generalized Reed-Solomon Code.

  • A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem Based on Reed-Solomon Codes
    arXiv: Cryptography and Security, 2012
    Co-Authors: Valérie Gauthier, Ayoub Otmani, Jean-pierre Tillich
    Abstract:

    Baldi et \textit{al.} proposed a variant of McEliece's cryptosystem. The main idea is to replace its permutation matrix by adding to it a rank 1 matrix. The motivation for this change is twofold: it would allow the use of Codes that were shown to be insecure in the original McEliece's cryptosystem, and it would reduce the key size while keeping the same security against generic decoding attacks. The authors suggest to use generalized Reed-Solomon Codes instead of Goppa Codes. The public Code built with this method is not anymore a generalized Reed-Solomon Code. On the other hand, it contains a very large secret generalized Reed-Solomon Code. In this paper we present an attack that is built upon a distinguisher which is able to identify elements of this secret Code. The distinguisher is constructed by considering the Code generated by component-wise products of Codewords of the public Code (the so-called "square Code"). By using square-Code dimension considerations, the initial generalized Reed-Solomon Code can be recovered which permits to deCode any ciphertext. A similar technique has already been successful for mounting an attack against a homomorphic encryption scheme suggested by Bogdanoc et \textit{al.}. This work can be viewed as another illustration of how a distinguisher of Reed-Solomon Codes can be used to devise an attack on cryptosystems based on them.