70 citations · 119 across the 11 of their papers we have counts for
17 papers
Interleaved Prange: A New Generic Decoder for Interleaved Codes
Anmoal Porwal, Lukas Holzbaur, Hedongliang Liu +3
Due to the recent challenges in post-quantum cryptography, several new approaches for code-based cryptography have been proposed. For example, a variant of the McEliece cryptosyste…
Generic Decoding in the Cover Metric
Sebastian Bitzer, Julian Renner, Antonia Wachter-Zeh +1
In this paper, we study the hardness of decoding a random code endowed with the cover metric. As the cover metric lies in between the Hamming and rank metric, it presents itself as…
Rank-Metric Codes and Their Applications
Hannes Bartz, Lukas Holzbaur, Hedongliang Liu +3
The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years…
Efficient Decoding of Gabidulin Codes over Galois Rings
Sven Puchinger, Julian Renner, Antonia Wachter-Zeh +1
This paper presents the first decoding algorithm for Gabidulin codes over Galois rings with provable quadratic complexity. The new method consists of two steps: (1) solving a syndr…
On Software Implementation of Gabidulin Decoders
Johannes Kunz, Julian Renner, Georg Maringer +2
This work compares the performance of software implementations of different Gabidulin decoders. The parameter sets used within the comparison stem from their applications in recent…
Low-Rank Parity-Check Codes over Galois Rings
Julian Renner, Alessandro Neri, Sven Puchinger
Low-rank parity-check (LRPC) are rank-metric codes over finite fields, which have been proposed by Gaborit et al. (2013) for cryptographic applications. Inspired by a recent adapti…
Generic Decoding in the Sum-Rank Metric
Sven Puchinger, Julian Renner, Johan Rosenkilde
We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric. The new method combines ideas of well-known generic decoders in the Hamming and rank m…
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power
Julian Renner, Sven Puchinger, Antonia Wachter-Zeh +2
We define and analyze low-rank parity-check (LRPC) codes over extension rings of the finite chain ring , where is a prime and is a positive integer. LRPC…
Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
Julian Renner, Thomas Jerkovits, Hannes Bartz +3
We address the problem of decoding Gabidulin codes beyond their unique error-correction radius. The complexity of this problem is of importance to assess the security of some rank-…
Efficient Decoding of Interleaved Low-Rank Parity-Check Codes
Julian Renner, Thomas Jerkovits, Hannes Bartz
An efficient decoding algorithm for horizontally u-interleaved LRPC codes is proposed and analyzed. Upper bounds on the decoding failure rate and the computational complexity of th…
Decoding High-Order Interleaved Rank-Metric Codes
Sven Puchinger, Julian Renner, Antonia Wachter-Zeh
This paper presents an algorithm for decoding homogeneous interleaved codes of high interleaving order in the rank metric. The new decoder is an adaption of the Hamming-metric deco…
Cryptanalysis of a System Based on Twisted Reed-Solomon Codes
Julien Lavauzelle, Julian Renner
Twisted Reed-Solomon (TRS) codes are a family of codes that contains a large number of maximum distance separable codes that are non-equivalent to Reed--Solomon codes. TRS codes we…
Interleaving Loidreau's Rank-Metric Cryptosystem
Julian Renner, Sven Puchinger, Antonia Wachter-Zeh
We propose and analyze an interleaved variant of Loidreau's rank-metric cryptosystem based on rank multipliers. We analyze and adapt several attacks on the system, propose design r…
LIGA: A Cryptosystem Based on the Hardness of Rank-Metric List and Interleaved Decoding
Julian Renner, Sven Puchinger, Antonia Wachter-Zeh
We propose the new rank-metric code-based cryptosystem LIGA which is based on the hardness of list decoding and interleaved decoding of Gabidulin codes. LIGA is an improved variant…
Twisted Gabidulin Codes in the GPT Cryptosystem
Sven Puchinger, Julian Renner, Antonia Wachter-Zeh
In this paper, we investigate twisted Gabidulin codes in the GPT code-based public-key cryptosystem. We show that Overbeck's attack is not feasible for a subfamily of twisted Gabid…
Repairing the Faure-Loidreau Public-Key Cryptosystem
Antonia Wachter-Zeh, Sven Puchinger, Julian Renner
A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem is proposed. The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special…
Experimental Comparison of Probabilistic Shaping Methods for Unrepeated Fiber Transmission
Julian Renner, Tobias Fehenberger, Metodi P. Yankov +4
This paper studies the impact of probabilistic shaping on effective signal-to-noise ratios (SNRs) and achievable information rates (AIRs) in a back-to-back configuration and in unr…