首页/论文/2009.09668

arXiv 2009.096682020-09-21cs.ITcs.CRmath.IT

On Software Implementation of Gabidulin Decoders

Johannes Kunz, Julian Renner, Georg Maringer, Thomas Schamberger, Antonia Wachter-Zeh

英文摘要：

This work compares the performance of software implementations of different Gabidulin decoders. The parameter sets used within the comparison stem from their applications in recently proposed cryptographic schemes. The complexity analysis of the decoders is recalled, counting the occurrence of each operation within the respective decoders. It is shown that knowing the number of operations may be misleading when comparing different algorithms as the run-time of the implementation depends on the instruction set of the device on which the algorithm is executed.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Decoding supercodes of Gabidulin codes and applications to cryptanalysis

This article discusses the decoding of Gabidulin codes and shows how to extend the usual decoder to any supercode of a Gabidulin code at the cost of a significant decrease of the decoding radius. Using this decoder, we provide polynomial time attacks on the rank-metric encryption schemes RAMESSES and LIGA.

2021-11-19cs.CRcs.ITmath.IT

Efficient Interpolation-Based Decoding of Interleaved Subspace and Gabidulin Codes

An interpolation-based decoding scheme for interleaved subspace codes is presented. The scheme can be used as a (not necessarily polynomial-time) list decoder as well as a probabilistic unique decoder. Both interpretations allow to decode interleaved subspace codes beyond half the minimum subspace distance. Further, an efficient interpolation procedure for the required linearized multivariate polynomials is presented and a computationally- and memory-efficient root-finding algorithm for the probabilistic unique decoder is proposed. These two efficient algorithms can also be applied for acceler…

2014-08-06cs.ITmath.IT

Right-hand side decoding of Gabidulin code and applications

We discuss the decoding of Gabidulin and interleaved Gabidulin codes. We give the full presentation of a decoding algorithm for Gabidulin codes, which as Loidreau's seminal algorithm consists in localizing errors in the spirit of Berlekamp-Welch algorithm for Reed-Solomon codes. On the other hand, this algorithm consists in acting on codewords on the right while Loidreau's algorithm considers an action on the left. This right-hand side decoder was already introduced by the authors in a previous work for cryptanalytic applications. We give here a generalised version which applies to the case of…

2022-03-04cs.CRcs.ITmath.IT

Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control

While random linear network coding is a powerful tool for disseminating information in communication networks, it is highly susceptible to errors caused by various sources. Due to error propagation, errors greatly deteriorate the throughput of network coding and seriously undermine both reliability and security of data. Hence error control for network coding is vital. Recently, constant-dimension codes (CDCs), especially Kötter-Kschischang (KK) codes, have been proposed for error control in random linear network coding. KK codes can also be constructed from Gabidulin codes, an important class …

2011-01-22cs.ITmath.IT

Decoding High-Order Interleaved Rank-Metric Codes

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 decoder by Metzner and Kapturowski (1990) and guarantees to correct all rank errors of weight up to $d-2$ whose rank over the large base field of the code equals the number of errors, where $d$ is the minimum rank distance of the underlying code. In contrast to previously-known decoding algorithms, the new decoder works for any rank-metric code, not only Gabidulin codes. It is purely based on linear-algebraic computation…

2019-04-18cs.ITmath.IT

LIGA: A Cryptosystem Based on the Hardness of Rank-Metric List and Interleaved Decoding

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 of the Faure-Loidreau (FL) system, which was broken in a structural attack by Gaborit, Otmani, and Talé Kalachi (GOT, 2018). We keep the FL encryption and decryption algorithms, but modify the insecure key generation algorithm. Our crucial observation is that the GOT attack is equivalent to decoding an interleaved Gabidulin code. The new key generation algorithm constructs public keys for which all polynomial-time i…

2020-05-18cs.CRcs.ITmath.IT

更多相关论文收起更多论文

Power Consumption of LDPC Decoders in Software Radio

LDPC code is a powerful error correcting code and has been applied to many advanced communication systems. The prosperity of software radio has motivated us to investigate the implementation of LDPC decoders on processors. In this paper, we estimate and compare complexity and power consumption of LDPC decoding algorithms running on general purpose processors. Using the estimation results, we show two power control schemes for software radio: SNR-based algorithm diversity and joint transmit power and receiver energy management. Overall, this paper discusses general concerns about using processo…

2011-03-26cs.ITmath.IT

快速软件极化码译码器

Fast Software Polar Decoders

McGill University（麦吉尔大学）

本文提出利用现代通用处理器实现高速软件极化码译码器，吞吐量超200 Mbps，适用于软件定义无线电，且性能优于通用处理器LDPC译码器，媲美GPU上的先进LDPC译码器。

2014-01-29cs.ITmath.IT

Fast and Flexible Software Polar List Decoders

Flexibility is one mandatory aspect of channel coding in modern wireless communication systems. Among other things, the channel decoder has to support several code lengths and code rates. This need for flexibility applies to polar codes that are considered for control channels in the future 5G standard. This paper presents a new generic and flexible implementation of a software Successive Cancellation List (SCL) decoder. A large set of parameters can be fine-tuned dynamically without re-compiling the software source code: the code length, the code rate, the frozen bits set, the puncturing patt…

2017-10-23cs.ITmath.IT

低延迟软件极化码译码器

Low-Latency Software Polar Decoders

McGill University（麦吉尔大学）；IMS Lab, Bordeaux-INP（波尔多国家高等电子学院 IMS 实验室）；École de technologie supérieure（高等技术学院）

本文提出利用现代处理器能力实现低延迟软件极化码译码器，通过多级算法调整显著降低延迟和内存占用，同时保持吞吐量，并验证了在GPU上的实现及能效优势。

2016-07-11cs.ITcs.PFmath.IT

Towards Practical Software Stack Decoding of Polar Codes

The successive cancellation list decoding algorithm for polar codes yields near-optimal decoding performance at the cost of high implementation complexity. The successive cancellation stack algorithm has been shown to provide similar decoding performance at a much lower computational complexity, but software implementations report a sub-par T/P performance. In this technical report, the benefits of the fast simplified successive cancellation list decoder are extended to the stack algorithm, resulting in a throughput increase by two orders of magnitude over the traditional stack decoder.

2018-09-10cs.ITmath.IT

极化码的快速列表译码算法

Fast List Decoders for Polar Codes

McGill University（麦吉尔大学）；University of California San Diego（加州大学圣迭戈分校）；École de technologie supérieure（高等技术学院）

本文提出一种基于展开译码树的极化码列表译码算法，将软件译码速度提升一个数量级，并在软件无线电应用中快于LDPC译码器，同时保持相当的纠错性能。

2015-11-10cs.ITmath.IT

Computationally Efficient Implementation of a Hamming Code Decoder using a Graphics Processing Unit

This paper presents a computationally efficient implementation of a Hamming code decoder on a graphics processing unit (GPU) to support real-time software-defined radio (SDR), which is a software alternative for realizing wireless communication. The Hamming code algorithm is challenging to parallelize effectively on a GPU because it works on sparsely located data items with several conditional statements, leading to non-coalesced, long latency, global memory access, and huge thread divergence. To address these issues, we propose an optimized implementation of the Hamming code on the GPU to exp…

2014-12-22cs.DCcs.ITmath.IT

Performance Peculiarities of Viterbi Decoder in Mathworks Simulink, GNU Radio and Other Systems with Likewise Implementation

The performance of convolutional codes decoding by the Viterbi algorithm should not depend on the particular distribution of zeros and ones in the input messages, as they are linear. However, it was identified that specific implementations of Add-Compare-Select unit for the Viterbi Algorithm demonstrate the decoding performance that depends on proportion of elements in the input message. It is conjectured that the modern commercial hard- and software defined communication equipment may also feature similar implementation and as such their decoding performance could also vary.

2015-10-05cs.ITmath.IT

Reed-Muller码投影聚合译码器的硬件实现

Hardware Implementation of Projection-Aggregation Decoders for Reed-Muller Codes

针对Reed-Muller码的译码需求，本文设计了UPA与CPA两种投影聚合译码变体的硬件架构，实验证明UPA的硬件实现资源占用更优、能耗更低，表明单独的软件优化不一定能带来硬件成本效益。

2024-08-20cs.ARcs.ITeess.SP

灵活且低复杂度的系统极化码编码与解码

Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes

McGill University（麦吉尔大学）；Technion—Israel Institute of Technology（以色列理工学院）；University of California at San Diego（加州大学圣地亚哥分校）；École de technologie supérieure（高等技术学院）

本文提出灵活且低复杂度的系统极化码编码与解码实现，支持任意长度和码率，硬件开销小，软件实现保持高吞吐量和低延迟。

2016-02-23cs.ITmath.IT