A New Class of Codes for Boolean Masking of Cryptographic Computations

DOI10.1109/TIT.2012.2200651MaRDI QIDQ2989794zbMATH OpenOpenAlexFDO

Authors Claude Carlet, Jon-Lark Kim, Philippe Gaborit, Patrick Solé

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1110.1193

Mathematics Subject Classification ID

Cryptography (94A60) Cyclic codes (94B15)

Abstract: We introduce a new class of rate one-half binary codes: {�f complementary information set codes.} A binary linear code of length $2n$ and dimension $n$ is called a complementary information set code (CIS code for short) if it has two disjoint information sets. This class of codes contains self-dual codes as a subclass. It is connected to graph correlation immune Boolean functions of use in the security of hardware implementations of cryptographic primitives. Such codes permit to improve the cost of masking cryptographic algorithms against side channel attacks. In this paper we investigate this new class of codes: we give optimal or best known CIS codes of length $<132.$ We derive general constructions based on cyclic codes and on double circulant codes. We derive a Varshamov-Gilbert bound for long CIS codes, and show that they can all be classified in small lengths $le12$ by the building up construction. Some nonlinear permutations are constructed by using $$-codes, based on the notion of dual distance of an unrestricted code.

Cited in

(11)

• Construction of single-deletion-correcting DNA codes using CIS codes
• Complementary dual codes for counter-measures to side-channel attacks
• Long quasi-polycyclic t-CIS codes
• Statistical properties of side-channel and fault injection attacks using coding theory
• Effective and efficient masking with low noise using small-Mersenne-prime ciphers
• Structural properties of self-dual monomial codes with application to code-based cryptography
• Complementary information set codes over \(\mathrm{GF}(p)\)
• Fast verification of masking schemes in characteristic two
• Optimal CIS codes, optimal t-CIS codes and their applications in cryptography
• CIS codes over ${\mathbb F}_4$
• \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays

This page was built for publication: A New Class of Codes for Boolean Masking of Cryptographic Computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989794)