IEEE Transactions on Information Theory · 2018 · 69 citations · 15 references
ComputingComputer ScienceMathematicsComputer SecurityCryptographyNumber TheoryCoding TheoryError Control CodingError-correcting CodesSide-channel AnalysisSide-channel AttacksAsymptotic AnalysisBinary CodesCyclic CodesInjection AttacksMinimum DistanceMinimum Distance Bounds
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 et al. 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 q-ary LCD codes have orthonormal basis, where q is a power of an odd prime.
15
Linear codes with complementary duals
James L. Massey · Discrete Mathematics · 1992 · 493 citations
Euclidean and Hermitian LCD MDS codes
Claude Carlet, Sihem Mesnager, Chunming Tang et al. · Designs Codes and Cryptography · 2018 · 118 citations · Full text