The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes

@inproceedings{Chabaud1996TheCS,
  title={The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes},
  author={Florent Chabaud and Jacques Stern},
  booktitle={ASIACRYPT},
  year={1996}
}
We present an algorithm that achieves general syndrome decoding of a (n; k; r) linear rank distance code over GF(q m) in O((nr + m) 3 q (m?r)(r?1)) elementary operations. As a consequence, the cryptographic Al schemes Che94, Che96] which rely on this problem are not secure with the proposed parameters. We also derive from our algorithm a bound on the minimal rank distance of a linear code which shows that the parameters from Che94] are inconsistent. | Abstract. We present an algorithm that… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

A new identiication algorithm

  • K Che, Chen
  • Cryptography Policy and Algorithms conference
  • 1996

Zen: A new toolbox for nite extensions in nite elds

  • Cl F Chabaud, R Lercier
  • Zen: A new toolbox for nite extensions in nite…
  • 1996

Improved Girault identiication scheme

  • K Che, Chen
  • IEE Electronic Letters
  • 1994

Theory of codes with maximum rank distance. Problems of Information Transmission

  • E M Gab, Gabidulin
  • Theory of codes with maximum rank distance…
  • 1985

Similar Papers

Loading similar papers…