|| Bent Sequences over Hadamard Codes for Physically Unclonable Functions
||Patrick Solé, L'Institut de Mathématiques de Marseille (Aix-Marseille Univ., Centrale Marseille, CNRS), France; Wei Cheng, Télécom Paris; Institut Polytechnique de Paris, France; Sylvain Guilley, Secure-IC S.A.S.; Télécom Paris; Institut Polytechnique de Paris, France; Olivier Rioul, Télécom Paris; Institut Polytechnique de Paris, France|
||D2-S5-T2: Combinatorial & Algebraic Codes
||Tuesday, 13 July, 23:20 - 23:40
||Tuesday, 13 July, 23:40 - 00:00
We study challenge codes for physically unclonable functions (PUFs). Starting from the classical Hadamard challenge code, we augment it by one vector. Numerical values suggest that the optimal choice of this vector for maximizing the entropy is to pick a vector the farthest away from the code formed by the challenges and their binary complements. This leads us to study the covering radius of Hadamard codes. A notion of bent sequence that generalizes the classical notion from Hadamard matrices of Sylvester type to general Hadamard matrices is given. Lower bounds for Paley-type Hadamard matrices are given.