On linear codes with random multiplier vectors and the maximum trace dimension property

DOI10.1515/jmc-2023-0022arXiv2309.00687MaRDI QIDQ6193383

Sándor Z. Kiss, Gábor P. Nagy, Márton Erdélyi, Pál Hegedűs

Publication date: 16 March 2024

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

trace codesweight enumeratorsubfield subcodesSingleton defectdimension of trace codesrandom alternant codes

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Vector spaces, linear dependence, rank, lineability (15A03)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• Random matrices and codes for the erasure channel
• How to mask the structure of codes for a cryptographic use
• A formula on the weight distribution of linear codes with applications to AMDS codes
• On the dimension and structure of the square of the dual of a Goppa code
• Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
• Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes
• Algebraic Function Fields and Codes
• Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes

This page was built for publication: On linear codes with random multiplier vectors and the maximum trace dimension property