Séminaire de Cryptographie

Accueil     Présentation     Archives

Vladimir Sidorenko

Decoding interleaved Gabidulin codes and skew complexity of sequences.

Gabidulin codes are the rank metric analogues of Reed?Solomon codes and have found many applications including network coding and cryptography. Interleaving or the direct sum of Gabidulin codes allows both decreasing the redundancy and increasing the error correcting capability for network coding. We consider a transform domain algorithm correcting both errors and erasures with interleaved Gabidulin codes. The transform-domain approach allows to simplify derivations and proofs and also simplifies finding the error vector after solving the key equation. We show that solving the key equation is similar to multi-sequence skew-feedback shift-register synthesis, which can be done effectively using Belekamp-Massey approach or by module minimization.