Linear complementary pair of group codes over finite chain rings

被引：12

作者：

Guneri, Cem ^{[1
]}

Martinez-Moro, Edgar ^{[2
]}

Sayici, Selcen ^{[1
]}

机构：

[1] Sabanci Univ, Fac Engn & Nat Sci, Istanbul, Turkey

[2] Univ Valladolid, Inst Math, Castilla, Spain

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2020年 / 88卷 / 11期

关键词：

LCP of codes; Group codes; Finite chain rings; Code equivalence;

D O I：

10.1007/s10623-020-00792-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 (C, D) is defined as the minimum of the minimum distances d(C) and d(D-perpendicular to). It has been recently shown that if C and D are both 2-sided group codes over a finite field, then C and D-perpendicular to are permutation equivalent. Hence the security parameter for an LCP of 2-sided group codes (C, D) is simply d(C). We extend this result to 2-sided group codes over finite chain rings.

引用

页码：2397 / 2405

页数：9

共 12 条

[1]

Bhasin S., 2015, IEEE INT S HARDW OR

[2] Do non-free LCD codes over finite commutative Frobenius rings exist? [J].