Interleaving Loidreau's Rank-Metric Cryptosystem
share
We propose and analyze an interleaved variant of Loidreau's rank-metric cryptosystem based on rank multipliers. It can be seen as the rank-metric analog of a recent proposal based on interleaved Goppa codes by Elleuch et al.. We analyze and adapt several attacks on the system, propose design rules, and study weak keys. Finding secure instances requires near-MRD rank-metric codes, which is so far underrepresented in the literature and leaves an interesting open problem. We give example parameters for potential key size reduction.
READ FULL TEXT