Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups

DOI10.1109/TIT.2015.2493539zbMath1359.94876DBLPjournals/tit/FaugereOPPT16arXiv1405.5101OpenAlexW1812316405WikidataQ62039152 ScholiaQ62039152MaRDI QIDQ2977045

Jean-Charles Faugère, Jean-Pierre Tillich, Ludovic Perret, Frédéric de Portzamparc, Ayoub Otmani

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.5101

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic codes (94B40)

Related Items (8)

Structural cryptanalysis of McEliece schemes with compact keys ⋮ Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes ⋮ Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes ⋮ Two classes of quasi-cyclic codes via irreducible polynomials ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes ⋮ Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ ⋮ Differential Power Analysis of a McEliece Cryptosystem

This page was built for publication: Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups