https://hal.telecom-paris.fr/hal-03718730Liu, YiYiLiuCheng, WeiWeiChengRioul, OlivierOlivierRioulGuilley, SylvainSylvainGuilleySolé, PatrickPatrickSoléKissing number of codes: A surveyHAL CCSD2023[MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT][INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]Rioul, OlivierVIASM2022-08-12 13:01:162022-08-18 10:43:572022-08-18 10:43:57enBook sectionsapplication/pdf1The 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.