Linear complementary pair of group codes over finite chain rings
| Autor: | Edgar Martínez-Moro, Cem Güneri, Selcen Sayici |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Information Theory Context (language use) Cryptography 0102 computer and information sciences 02 engineering and technology Data_CODINGANDINFORMATIONTHEORY 01 natural sciences Permutation Chain (algebraic topology) 0202 electrical engineering electronic engineering information engineering Side channel attack Mathematics Computer Science::Cryptography and Security Discrete mathematics business.industry Information Theory (cs.IT) Applied Mathematics 020206 networking & telecommunications 16. Peace & justice Computer Science Applications Finite field 010201 computation theory & mathematics Group code QA150-272.5 Algebra business Security parameter |
| DOI: | 10.1007/s10623-020-00792-1 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|