Polynomial time key-recovery attack on high rate random alternant codes

DOI10.1109/TIT.2023.3334592MaRDI QIDQ6576622zbMATH OpenFDO

Authors Magali Bardet, Rocco Mora, Jean-Pierre Tillich

Publication date 23 July 2024

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

Full work available at URL https://doi.org/10.1109/TIT.2023.3334592

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(6)

• The syzygy distinguisher
• Understanding the new distinguisher of alternant codes at degree 2
• On the matrix code of quadratic relationships for a Goppa code
• The impact of alternant codes over Eisenstein integers on modern technology
• Explicit bases for Riemann-Roch spaces on elliptic curves and their application in constructing various elliptic code families
• Some infinite families of binary Goppa codes with determined minimum distances

This page was built for publication: Polynomial time key-recovery attack on high rate random alternant codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576622)