LRPC (Low Rank Parity Check) codes are the rank-metric analog to the well-studied LDPC codes in the Hamming metric. They are a relatively new family of codes[2] which is well suited to cryptographic applications due to their weak algebraic structure. There exists an efficient decoding algorithm for LRPC codes which was recently improved by the use of ideal codes (changing the structure of the parity-check matrix such that keys are smaller) and the syndrome space expansion algorithm (Increasing the number of syndromes that can be decoded). 

During the seminar the student should understand and summarize the content of paper[1], especially: 

-The concept of LRPC codes and their basic decoding,

-The extension to ideal/double circulant LRPC codes ( -> reduce keysize),

-The syndrome space expansion algorithm ( -> improve the number of decodable syndromes). 

required reading:

[1] Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography

recommended reading on LRPC codes:

[2] Low Rank Parity Check codes and their application to cryptography

for some application:

[3] RankSign: an efficient signature algorithm based on the rank metric

Proficiency in linear algebra

Basics of coding theory, not necessarily in the rank metric 

Knowledge of LDPC/LRPC codes is a plus