Kissing number of codes: A survey - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2023

Kissing number of codes: A survey

, , , ,
Yi Liu
  • Fonction : Auteur
  • PersonId : 1108503
Wei Cheng
  • Fonction : Auteur
  • PersonId : 751842
  • IdHAL : wei-cheng
Olivier Rioul
Sylvain Guilley
Patrick Solé
  • Fonction : Auteur
  • PersonId : 1100094

Résumé

The kissing number of a code is the average number of pairs of codewords at minimum distance from each other. It has fundamental applications in determining codes performances. Besides, a recent interest has arisen from the field of side- channel analysis of algorithms handling sensitive information (e.g., cryptographic keys). Namely, when code-base masking protections are applied, their performance in terms of attacker’s signal-to-noise ratio or mutual information is proportional to the kissing number of the masking code. Therefore the kissing number is also a security metric for a given minimum distance in side-channel protected implementation, as it is in codes performance evaluation. It is known exactly for some classical families of codes. To estimate it in general, two types of bounds are given. Linear programming, either numerically or by the polynomial method is the most versatile and the more precise. Spectral graph theory provides bounds on the multiplicity of the subdominant eigenvalue that are easier to state.
Fichier principal
Vignette du fichier
202111liuchengrioulguilleysole.pdf (260.77 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03718730 , version 1 (12-08-2022)

Identifiants

  • HAL Id : hal-03718730 , version 1

Citer

Yi Liu, Wei Cheng, Olivier Rioul, Sylvain Guilley, Patrick Solé. Kissing number of codes: A survey. VIASM. Coding Theory and applications (tentative title), Springer, In press, Lecture Notes in Mathematics. ⟨hal-03718730⟩
266 Consultations
19 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More