On the security of subspace subcodes of Reed-Solomon codes for public key encryption release_3clv4io3hveenmn3rebqpiera4

by Alain Couvreur, Matthieu Lequesne

Released as a article .

2020  

Abstract

This article discusses the security of McEliece-like encryption schemes using subspace subcodes of Reed-Solomon codes, i.e. subcodes of Reed-Solomon codes over 𝔽_q^m whose entries lie in a fixed collection of 𝔽_q-subspaces of 𝔽_q^m. These codes appear to be a natural generalisation of Goppa and alternant codes and provide a broader flexibility in designing code based encryption schemes. For the security analysis, we introduce a new operation on codes called the twisted product which yields a polynomial time distinguisher on such subspace subcodes as soon as the chosen 𝔽_q-subspaces have dimension larger than m/2. From this distinguisher, we build an efficient attack which in particular breaks some parameters of a recent proposal due to Khathuria, Rosenthal and Weger.
In text/plain format

Archived Files and Locations

application/pdf  504.4 kB
file_i5vetj7zhndkbiv4k7tfpqwbpu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-09-12
Version   v1
Language   en ?
arXiv  2009.05826v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 0decf1d4-37c6-4062-9d95-935e0a41ce33
API URL: JSON