Section: New Results

On the security of compact McEliece keys

E. Barelli presented at WCC 2017 (Workshop on Coding and Cryptography, St Petersburg, Russia) her recent results on the analysis of McEliece scheme based on alternant codes with a non trivial automorphism group [16]. These codes were suggested for public key encryption since, compared to codes with trivial automorphism group, they could provide shorter keys.

If the security with respect to generic decoding attacks is almost unchanged when considering codes with non trivial automorphisms, E. Barelli proved that the security with respect to key recovery attacks is highly reduced since, it reduces to recover the structure of the subcode of fixed elements by the automorphism group.