2000 character limit reached
Decoding supercodes of Gabidulin codes and applications to cryptanalysis
Published 3 Mar 2021 in cs.CR, cs.IT, and math.IT | (2103.02700v3)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.