7 papers
An Attack on High Rate McEliece Cryptosystems Using Generalized Reed Solomon Codes with Weight Mask
Julia Lieb, Abhinaba Mazumder, Michael Schaller
Due to the insecurity of McEliece cryptosystems instantiated with Generalized Reed-Solomon codes, there have been several proposals of McEliece type systems that replace the permut…
A Survey on Code Equivalence: The State-of-the-Art and Open Questions
Anna-Lena Horlemann, Abhinaba Mazumder, Michael Schaller +1
In this work, we provide a comprehensive survey of the code equivalence problem and its variants. We explain the existing results, highlighting the relationships between different…
The Power of Power Codes: New Classes of Easy Instances for the Linear Equivalence Problem
Michele Battagliola, Anna-Lena Horlemann, Abhinaba Mazumder +4
Given two linear codes, the Linear Equivalence Problem (LEP) asks to find (if it exists) a linear isometry between them; as a special case, we have the Permutation Equivalence Prob…
Construction and Decoding of Convolutional Codes with optimal Column Distances
Julia Lieb, Michael Schaller
The construction of Maximum Distance Profile (MDP) convolutional codes in general requires the use of very large finite fields. In contrast convolutional codes with optimal column…
Information-Set Decoding for Convolutional Codes
Niklas Gassner, Julia Lieb, Abhinaba Mazumder +1
In this paper, we present a framework for generic decoding of convolutional codes, which allows us to do cryptanalysis of code-based systems that use convolutional codes. We then a…
Algorithms for Computing the Free Distance of Convolutional Codes
Zita Abreu, Joachim Rosenthal, Michael Schaller
The free distance of a convolutional code is a reliable indicator of its performance. However its computation is not an easy task. In this paper, we present some algorithms to comp…