CIS codes over ${\mathbb F}_4$
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
We study the complementary information set codes (for short, CIS codes) over ${\mathbb F}_4$. They are strongly connected to correlation-immune functions over ${\mathbb F}_4$. Also the class of CIS codes includes the self-dual codes. We find a construction method of CIS codes over ${\mathbb F}_4$ and a criterion for checking equivalence of CIS codes over ${\mathbb F}_4$. We complete the classification of all inequivalent CIS codes of length up to $8$ over ${\mathbb F}_4$.
Abstract
We study the complementary information set codes (for short, CIS codes) over ${\mathbb F}_4$. They are strongly connected to correlation-immune functions over ${\mathbb F}_4$. Also the class of CIS codes includes the self-dual codes. We find a construction method of CIS codes over ${\mathbb F}_4$ and a criterion for checking equivalence of CIS codes over ${\mathbb F}_4$. We complete the classification of all inequivalent CIS codes of length up to $8$ over ${\mathbb F}_4$.
참고문헌 (16)
- W. Bosma, "The Magma algebra system I : The user language", J. Symbolic Comput, 24, pp.235~265 (1997)
- P. Camion, "A. Canteaut. Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography", Designs Codes Crypt, 16(2), pp.121~149 (1999)
- P. Camion, "On correlation-immune functions", Lecture Notes in Computer Science, 576, pp.86~100 (1992)
- C. Carlet, "More correlation-immune and resilient functions over Galois fields and Galois rings", Lecture Note in Computer Sciences, 1233, pp.422~433 (1997), Springer Verlag
- C. Carlet, "Higher-order CIS codes", IEEE Trans. Inform. Theory, 60(9), pp.5283~5295 (2014)
- C. Carlet, "A new class of codes for Boolean masking of cryptographic computations", IEEE Trans. Inform. Theory, 58, pp.6000~6011 (2012)
- K. Gopalakrishnan, "Three characterizations of non-binary correlation-immune and resilient functions", Designs Codes Crypt, 5, pp.241~251 (1995)
- code and formally self-dual codes, "Finte Fields Appl", 1997, 131~139
- M. Harada, "Classification of self-dual codes of length 36", Adv. Math. Commun, 6, pp.229~235 (2012)
- H. J. Kim, "Complementary information set codes over GF(p)", De-signs Codes Crypt, 81, pp.541~555 (2016)
- H. J. Kim, "t-CIS codes over GF(p)and orthogonal arrays", Discrete Applied Mathematics, 217, pp.601~612 (2017)
- J. -L. Kim, "New extremal self-dual codes of lengths 36, 38 and 58", IEEE Trans. Inform. Theory, 47, pp.386~393 (2001)
- J. -L. Kim, "Euclidean and Hermitian self-dual MDS codes over large finite fields", J. Combin. Theory Ser. A, 105(1), pp.79~95 (2004)
- C.P. Schnorr, "Black box cryptanalysis of hash networks based on multipermutations", Lecture Note in Computer Science, 950, pp.47~57 (1995), Springer Verlag
- T. Siegenthaler, "Correlation-immunity of non-linear Combining functions for cryptographic applications", IEEE Trans. Inform. Theory, 30(5), pp.776~780 (1984)