Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Generator polynomials of cyclic expurgated or extended Goppa codes (2405.18023v1)

Published 28 May 2024 in cs.IT and math.IT

Abstract: Classical Goppa codes are a well-known class of codes with applications in code-based cryptography, which are a special case of alternant codes. Many papers are devoted to the search for Goppa codes with a cyclic extension or with a cyclic parity-check subcode. Let $\Bbb F_q$ be a finite field with $q=2l$ elements, where $l$ is a positive integer. In this paper, we determine all the generator polynomials of cyclic expurgated or extended Goppa codes under some prescribed permutations induced by the projective general linear automorphism $A \in PGL_2(\Bbb F_q)$. Moreover, we provide some examples to support our findings.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (34)
  1. M. Bardet, R. Mora, and J. P. Tillich, “Polynomial time key-recovery attack on high rate random alternant codes,” preprint 2023.
  2. T. P. Berger, “Cyclic alternant codes induced by an automorphism of a GRS code,” in Finite Field Theory, Applications and Algorithm (Contemporary Mathematics), R. Mullin and G. Mullen, Eds. Providence, RI, USA: American Mathematical Society, vol. 225, pp. 143-154, 1999.
  3. T. P. Berger, “New classes of cyclic extended Goppa codes,” IEEE Trans. Inf. Theory, vol. 45, no. 4, pp. 1264-1266, 1999.
  4. T. P. Berger, “Goppa and related codes invariant under a prescribed permutation,” IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 2628-2633, 2000.
  5. T. P. Berger, “On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes,” Finite Fields Appl., vol. 6, no. 3, pp. 255-281, 2000.
  6. T. P. Berger, “Quasi-cyclic Goppa codes,” In: Proceedings of IEEE International Symposium on Information Theory, 2000.
  7. E. R. Berlekamp and O. Moreno, “Extended double-error-correcting binary Goppa codes are cyclic,” IEEE Trans. Inform. Theory, IT-19, pp. 817-818 1973.
  8. A. Couvreur, I. M. Corbella, and R. Pellikaan, “A polynomial time attack against algebraic geometry code based public key cryptosystems,” In 2014 IEEE International Symposium on Information Theory, pp. 1446-1450, 2014.
  9. A. Couvreur, R. Mora, and J. P. Tillich, “A new approach based on quadratic forms to attack the McEliece cryptosystem,” preprint 2023.
  10. B. Chen and G. Zhang, “Enumeration of Extended Irreducible Binary Goppa Codes,” IEEE Trans. Inf. Theory, vol. 68, no. 8, pp. 5145-5153, 2022.
  11. B. Chen and G. Zhang, “A Tight Upper Bound on the Number of Non-Zero Weights of a Cyclic Code,” IEEE Trans. Inf. Theory, vol. 69, no. 2, pp. 995-1004, 2023.
  12. G. I. Feng, K. K. Tzeng, “Further results about the cyclicity of generalized Goppa codes,” Discr. Math. vol. 56, pp. 281-290, 1985.
  13. J. C. Fauge``𝑒\grave{e}over` start_ARG italic_e end_ARGre, L. Perret, and F. D. Portzamparc, “Algebraic attack against variants of McEliece with Goppa polynomial of a special form,” In International Conference on the Theory and Application of Cryptology and Information Security, pp. 21-41, Berlin, Heidelberg: Springer Berlin Heidelberg, 2014.
  14. V. Goppa, “A new class of linear error correcting codes,” Probl. Peredachi Inf., vol. 6, no. 3, pp. 207-212, 1970.
  15. V. Goppa, “Rational representation of codes and (L,g) codes,” Probl. Peredachi Inf., vol. 7, no. 3, pp. 41-49, 1971.
  16. W. Huffman, V. Pless, “Fundamentals of Error Correcting codes,” Cambridge University Press, Cambridge, 2003.
  17. E. Kirshanova, and A. May, “Decoding McEliece with a Hint-Secret Goppa Key Parts Reveal Everything,” International Conference on Security and Cryptography for Networks, Cham: Springer International Publishing, 2022.
  18. R. Lidl and H. Niederreiter, “Finite Fields,” Cambridge University Press, Cambridge, 2008.
  19. X. Li, Q. Yue, “Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes,” Des. Codes Cryptogr., vol. 90, no. 7, pp. 1629-1647, 2022.
  20. X. Li, Q. Yue, “Construction of expurgated and extended Goppa codes with dihedral automorphism groups,” IEEE Trans. Inf. Theory, vol. 68, no. 10, pp. 6472-6480, 2022.
  21. F. MacWilliams and N. Sloane, “The Theory of Error-Corrcting codes,” North Holland, Amsterdam, 1977.
  22. R. J. McEliece, “A public-key cryptosystem based on algebraic coding theory,” DSN Progress Report 42-44, pp. 114-116, 1978.
  23. PQC Standardization Process: Announcing Four Candidates to be Standardized, Plus Fourth Round Candidates [EB/OL]. https://csrc.nist.gov/News/2022/pqc-candidates-to-be-standardized-and-round-4.
  24. E. Richard. “Groups and Group Actions,” Hilary and Trinity Terms, 2014.
  25. R. M. Roth, “Introduction to Coding Theory,” Cambridge University Press, Cambridge, 2006.
  26. V. M. Sidelnikov and S. O. Shestakov, “On insecurity of cryptosystems based on generalized Reed-Solomon codes,” Discr. Math. AppL, vol. 2, no. 4, pp. 439-444, 1992.
  27. H. Stichtenoth, “Which extended Goppa codes are cyclic?” J. Comb. Theory, vol. 51, pp. 205-220, 1989.
  28. J. A. Thiong-Ly, “Automorphisms of two families of extended non binary cyclic Goppa codes,” In Lecture Notes in Computer Science, vol. 229. New York/Berlin: Springer-Verlag, pp. 112-121, 1985.
  29. K. K. Tzeng and C. Y. Yu, “Characterization theorems for extending Goppa codes to cyclic codes,” IEEE Trans. Inform. Theory, vol. 25, pp. 246-250, 1979.
  30. K. K. Tzeng and K. Zimmermann, “On extending Goppa codes to cyclic codes,” IEEE Trans. Inform. Theory, vol. 21, pp. 712-716, 1975.
  31. A. L. Vishnevetskii, “Cyclicity of extended Goppa codes,” Probl. Pered. Inform., vol. 18, pp. 171-175, 1982.
  32. C. Wieschebrink, “Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes,” In Post-Quantum Cryptography: Third International Workshop, PQCrypto 2010, Darmstadt, Germany, May 25-28, 2010. Proceedings 3 (pp. 61-72). Springer Berlin Heidelberg, 2010.
  33. Y. Wu, Q. Yue, and S. Fan, “Self-reciprocal and self-conjugate-reciprocal irreducible factors of xn−λsuperscript𝑥𝑛𝜆x^{n}-\lambdaitalic_x start_POSTSUPERSCRIPT italic_n end_POSTSUPERSCRIPT - italic_λ and their applications,” Finite Fields Appl., vol. 63, pp. 101648, 2020.
  34. C. Xing and S. Ling, “Coding Theory: A First Course,” Cambridge University Press, 2003.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets