Goppa-like AG codes from C_{a,b} curves and their behaviour under squaring their dual

arXiv2303.08687MaRDI QIDQ6429693FDOQ6429693

Authors: Sabira El Khalfaoui, Mathieu Lhotel, Jade Nardi 

Publication date: 15 March 2023

Abstract: In this paper, we introduce a family of codes that can be used in a McEliece cryptosystem, called Goppa--like AG codes. These codes generalize classical Goppa codes and can be constructed from any curve of genus $mathfrakggeq0$. Focusing on codes from $C_{a,b}$ curves, we study the behaviour of the dimension of the square of their dual to determine their resistance to distinguisher attacks similar to the one for alternant and Goppa codes developed by Mora and Tillich. We also propose numerical experiments to measure how sharp is our bound.

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Algebraic functions and function fields in algebraic geometry (14H05)

This page was built for publication: Goppa-like AG codes from $C_{a,b}$ curves and their behaviour under squaring their dual

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