On the security of Some Compact Keys for McEliece Scheme - Archive ouverte HAL Access content directly
Conference Papers Year :

On the security of Some Compact Keys for McEliece Scheme

(1)
1

Abstract

In this paper we study the security of the key of compact McEliece schemes based on alternant/Goppa codes with a non-trivial permutation group, in particular quasi-cyclic alternant codes. We show that it is possible to reduce the key-recovery problem on the original quasi-cyclic code to the same problem on a smaller code derived from the public key. This result is obtained thanks to the invariant operation which gives the subcode whose elements are invariant under a permutation σ ∈ Perm(C). The fundamental advantage of this invariant code is that it preserves the alternant structure, ie: the invariant subcode of an alternant code is an alternant code. This approach improves the technique of Faugère, Otmani, Tillich, Perret and Portzamparc which uses folded codes of alternant codes obtained by using supports globally stable by an affine map. We use a simpler approach with a unified view on quasi-cyclic alternant codes and we extend the key-recovery to the non-affine case, for all codes obtained by using supports globally stable by a homography.
Fichier principal
Vignette du fichier
quasi-cyclic_alt_codes.pdf (439 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01674546 , version 1 (03-01-2018)

Identifiers

  • HAL Id : hal-01674546 , version 1

Cite

Elise Barelli. On the security of Some Compact Keys for McEliece Scheme. WCC 2017 - The Tenth International Workshop on Coding and Cryptography, Sep 2017, St Petersbourg, Russia. pp.1-9. ⟨hal-01674546⟩
50 View
34 Download

Share

Gmail Facebook Twitter LinkedIn More