New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem

  title={New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem},
  author={Adrien Hauteville and J. Tillich},
  journal={2015 IEEE International Symposium on Information Theory (ISIT)},
  • Adrien Hauteville, J. Tillich
  • Published 2015
  • Computer Science, Mathematics
  • 2015 IEEE International Symposium on Information Theory (ISIT)
  • We consider the decoding problem or the problem of finding low weight codewords for rank metric codes. We show how additional information about the codeword we want to find under the form of certain linear combinations of the entries of the codeword leads to algorithms with a better complexity. This is then used together with a folding technique for attacking a McEliece scheme based on LRPC codes. It leads to a feasible attack on one of the parameters suggested in [11]. 

    Topics from this paper.

    RankSynd a PRNG Based on Rank Metric
    • 8
    • PDF
    Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
    • 12
    • PDF
    Efficient Encryption From Random Quasi-Cyclic Codes
    • 51
    • PDF
    Durandal: a rank metric based signature scheme
    • 20
    • PDF


    Publications referenced by this paper.
    The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes
    • 57
    Low Rank Parity Check codes and their application to cryptography
    • 75
    • Highly Influential
    • PDF
    On the inherent intractability of certain coding problems (Corresp.)
    • 1,234
    New Results for Rank-Based Cryptography
    • 46
    • Highly Influential
    On the Complexity of the Rank Syndrome Decoding Problem
    • 73
    • Highly Influential
    • PDF
    MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes
    • 267
    • PDF
    Weak keys in the McEliece public-key cryptosystem
    • 65
    • PDF
    Symmetric matrices and codes correcting rank errors beyond the [(d-1)/2] bound
    • 12