On Software Implementation of Gabidulin Decoders

TL;DR

This paper compares software implementations of Gabidulin decoders, analyzing their complexity and performance, and highlights that runtime depends on device instruction sets rather than just operation counts.

Contribution

It provides a performance comparison of Gabidulin decoders in software, considering real-world execution factors beyond theoretical operation counts.

Findings

Operation count alone can be misleading for performance comparison.

Runtime depends on the device's instruction set architecture.

Different decoders show varied performance profiles in practice.

Abstract

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.