Construction of Efficient Codes for High-Order Direct Sum Masking


Creative Commons License

Carlet C., Guılley S., Güneri C., Mesnager S., Özbudak F.

Security and Privacy in the Internet of Things: Challenges and Solutions, José Luis Hernández Ramos,Antonio Skarmeta, Editör, IOS Press , Amsterdam, ss.108-128, 2020

  • Yayın Türü: Kitapta Bölüm / Araştırma Kitabı
  • Basım Tarihi: 2020
  • Yayınevi: IOS Press
  • Basıldığı Şehir: Amsterdam
  • Sayfa Sayıları: ss.108-128
  • Editörler: José Luis Hernández Ramos,Antonio Skarmeta, Editör
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.