New Characterization and Parametrization of LCD Codes

Linear complementary dual (LCD) cyclic codes were referred historically to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD codes. In particular, it has been shown that binary LCD codes play an important role in implementations against side-channel attacks and fault injection attacks. In this paper, we first present a new characterization of binary LCD codes in terms of their orthogonal or symplectic basis. Using such a characterization, we solve a conjecture proposed by Galvez <italic>et al.</italic> on the minimum distance of binary LCD codes. Next, we consider the action of the orthogonal group on the set of all LCD codes, determine all possible orbits of this action, derive simple closed formulas of the size of the orbits, and present some asymptotic results on the size of the corresponding orbits. Our results show that almost all binary LCD codes are odd-like codes with odd-like duals, and about half of <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>-ary LCD codes have orthonormal basis, where <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> is a power of an odd prime.

[1]  Sihem Mesnager,et al.  Euclidean and Hermitian LCD MDS codes , 2017, Des. Codes Cryptogr..

[2]  Jean-Pierre Serre A Course in Arithmetic , 1973 .

[3]  James L. Massey,et al.  Linear codes with complementary duals , 1992, Discret. Math..

[4]  Jon-Lark Kim,et al.  The combinatorics of LCD codes: linear programming bound and orthogonal matrices , 2015, Int. J. Inf. Coding Theory.

[5]  J. Humphreys A Course in Group Theory , 1996 .

[6]  Sihem Mesnager,et al.  Linear Codes Over 𝔽q Are Equivalent to LCD Codes for q>3 , 2018, IEEE Trans. Inf. Theory.

[7]  Sihem Mesnager,et al.  On σ-LCD codes , 2017, ArXiv.

[8]  Sihem Mesnager,et al.  Linear codes over Fq which are equivalent to LCD codes , 2017, ArXiv.

[9]  Claude Carlet,et al.  Orthogonal Direct Sum Masking - A Smartcard Friendly Computation Paradigm in a Code, with Builtin Protection against Side-Channel and Fault Attacks , 2014, WISTP.

[10]  H. Weyl The Classical Groups , 1940 .

[11]  Cunsheng Ding,et al.  LCD Cyclic Codes Over Finite Fields , 2017, IEEE Transactions on Information Theory.

[12]  J. Macwilliams,et al.  Orthogonal Matrices Over Finite Fields , 1969 .

[13]  Sihem Mesnager,et al.  Complementary Dual Algebraic Geometry Codes , 2016, IEEE Transactions on Information Theory.

[14]  John Sheekey,et al.  On Rank Problems for Subspaces of Matrices over Finite Fields , 2012 .

[15]  Claude Carlet,et al.  Complementary dual codes for counter-measures to side-channel attacks , 2016, Adv. Math. Commun..

[16]  Nicolas Sendrier,et al.  On the Dimension of the Hull , 1997, SIAM J. Discret. Math..

[17]  Jon-Lark Kim,et al.  Some bounds on binary LCD codes , 2017, Cryptography and Communications.

[18]  Cunsheng Ding,et al.  Two Families of LCD BCH Codes , 2016, IEEE Transactions on Information Theory.