title
  

Construction of efficient codes for high-order direct sum masking

Carlet, Claude and Guilley, Sylvain and Güneri, Cem and Mesnager, Sihem and Özbudak, Ferruh (2020) Construction of efficient codes for high-order direct sum masking. In: Ramos, José Luis Hernández and Skarmeta, Antonio, (eds.) Security and Privacy in the Internet of Things: Challenges and Solutions. Ambient Intelligence and Smart Environments, 27. IOS Press, Holland, pp. 108-128. ISBN 978-1-64368-052-1 (Print) 978-1-64368-053-8 (Online)

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
206Kb

Official URL: http://dx.doi.org/10.3233/AISE200008

Abstract

Linear complementary dual (LCD) codes and linear complementary pairs (LCP) of codes have been proposed as counter-measures against side-channel attacks (SCA) and fault injection attacks (FIA) in the context of direct sum masking (DSM). Although LCD codes were introduced by Massey long ago for other reasons, there has been a renewed interest in coding theory community for these kinds of codes due to these new applications. It has later been observed that the counter-measure against FIA may possibly lead to a vulnerability for SCA when the whole algorithm needs to be masked (in environments like smart cards). This led to a variant of the LCD and LCP problems, where some partial results have been very recently obtained by the authors. This chapter reviews the coding theoretic problems and solutions related to the security problems mentioned.

Item Type:Book Section / Chapter
Subjects:Q Science > QA Mathematics > QA150-272.5 Algebra
Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:40278
Deposited By:Cem Güneri
Deposited On:18 Sep 2020 11:57
Last Modified:18 Sep 2020 11:57

Repository Staff Only: item control page