Enumeration of extended irreducible binary Goppa codes
Bocong Chen, Guanghui Zhang

TL;DR
This paper introduces a new method to estimate the upper bound on the number of inequivalent extended irreducible binary Goppa codes, which are crucial for cryptographic security assessments.
Contribution
It provides a novel approach to bound the count of inequivalent Goppa codes with specific parameters, aiding cryptosystem security evaluation.
Findings
Established an upper bound for the number of inequivalent codes
Focused on codes with length q+1 and degree r
Applicable for odd prime n and specific gcd conditions
Abstract
The family of Goppa codes is one of the most interesting subclasses of linear codes. As the McEliece cryptosystem often chooses a random Goppa code as its key,knowledge of the number of inequivalent Goppa codes for fixed parameters may facilitate in the evaluation of the security of such a cryptosystem. In this paper we present a new approach to give an upper bound on the number of inequivalent extended irreducible binary Goppa codes. To be more specific, let be an odd prime number and ; let be a positive integer satisfying and . We obtain an upper bound for the number of inequivalent extended irreducible binary Goppa codes of length and degree .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Islamic Finance and Communication · graph theory and CDMA systems
