Skip to main content
Top
Published in: Designs, Codes and Cryptography 11/2020

29-08-2020

Linear complementary pair of group codes over finite chain rings

Authors: Cem Güneri, Edgar Martínez-Moro, Selcen Sayıcı

Published in: Designs, Codes and Cryptography | Issue 11/2020

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Linear complementary dual (LCD) codes and linear complementary pair (LCP) of codes over finite fields have been intensively studied recently due to their applications in cryptography, in the context of side channel and fault injection attacks. The security parameter for an LCP of codes (CD) is defined as the minimum of the minimum distances d(C) and \(d(D^\bot )\). It has been recently shown that if C and D are both 2-sided group codes over a finite field, then C and \(D^\bot \) are permutation equivalent. Hence the security parameter for an LCP of 2-sided group codes (CD) is simply d(C). We extend this result to 2-sided group codes over finite chain rings.
Literature
1.
go back to reference Bhasin S., Danger J.-L., Guilley S., Najm Z., Ngo X.T.: Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan horses. In: IEEE International Symposium on Hardware Oriented Security and Trust (HOST), May 5–7, (2015) Bhasin S., Danger J.-L., Guilley S., Najm Z., Ngo X.T.: Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan horses. In: IEEE International Symposium on Hardware Oriented Security and Trust (HOST), May 5–7, (2015)
2.
go back to reference Bhowmick S., Fotue-Tabue A., Martínez-Moro E., Bandi R., Bagchi Satya: Do non-free LCD codes over finite commutative Frobenius rings exist? Des. Codes Cryptogr. 88, 825–840 (2020).MathSciNetCrossRef Bhowmick S., Fotue-Tabue A., Martínez-Moro E., Bandi R., Bagchi Satya: Do non-free LCD codes over finite commutative Frobenius rings exist? Des. Codes Cryptogr. 88, 825–840 (2020).MathSciNetCrossRef
3.
go back to reference Borello M., de Cruz J., Willems W.: A note on linear complementary pairs of group codes. Discret. Math. 343, 111905 (2020).MathSciNetCrossRef Borello M., de Cruz J., Willems W.: A note on linear complementary pairs of group codes. Discret. Math. 343, 111905 (2020).MathSciNetCrossRef
4.
go back to reference Bringer J., Carlet C., Chabanne H., Guilley S., Maghrebi H.: Orthogonal direct sum masking: a smartcard friendly computation paradigm in a code, with builtin protection against side-channel and fault attacks. In: WISTP, pp. 40–56. Springer, Heraklion (2014). Bringer J., Carlet C., Chabanne H., Guilley S., Maghrebi H.: Orthogonal direct sum masking: a smartcard friendly computation paradigm in a code, with builtin protection against side-channel and fault attacks. In: WISTP, pp. 40–56. Springer, Heraklion (2014).
5.
go back to reference Carlet C., Güneri C., Özbudak F., Özkaya B., Solé P.: On linear complementary pairs of codes. IEEE Trans. Inf. Theory 64, 6583–6589 (2018).MathSciNetCrossRef Carlet C., Güneri C., Özbudak F., Özkaya B., Solé P.: On linear complementary pairs of codes. IEEE Trans. Inf. Theory 64, 6583–6589 (2018).MathSciNetCrossRef
6.
go back to reference Güneri C., Özkaya B., Sayıcı S.: On linear complementary pair of \(n\)D cyclic codes. IEEE Commun. Lett. 22, 2404–2406 (2018).CrossRef Güneri C., Özkaya B., Sayıcı S.: On linear complementary pair of \(n\)D cyclic codes. IEEE Commun. Lett. 22, 2404–2406 (2018).CrossRef
11.
go back to reference Norton G.H., Salagean A.: On the structure of linear and cyclic codes over a finite chain ring. Appl. Algebr. Eng. Commun. Comput. 10, 489–506 (2000).MathSciNetCrossRef Norton G.H., Salagean A.: On the structure of linear and cyclic codes over a finite chain ring. Appl. Algebr. Eng. Commun. Comput. 10, 489–506 (2000).MathSciNetCrossRef
12.
go back to reference Norton G.H., Salagean A.: On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory 46, 1060–1067 (2000).MathSciNetCrossRef Norton G.H., Salagean A.: On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory 46, 1060–1067 (2000).MathSciNetCrossRef
Metadata
Title
Linear complementary pair of group codes over finite chain rings
Authors
Cem Güneri
Edgar Martínez-Moro
Selcen Sayıcı
Publication date
29-08-2020
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 11/2020
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-020-00792-1

Other articles of this Issue 11/2020

Designs, Codes and Cryptography 11/2020 Go to the issue

Premium Partner