Skip to Main content Skip to Navigation
Conference papers

Bent Sequences over Hadamard Codes for Physically Unclonable Functions

Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Patrick Sol'e Connect in order to contact the contributor
Submitted on : Thursday, May 27, 2021 - 10:32:43 PM
Last modification on : Sunday, June 26, 2022 - 3:08:49 AM
Long-term archiving on: : Saturday, August 28, 2021 - 8:19:07 PM


Files produced by the author(s)


  • HAL Id : hal-03240109, version 1


Patrick Solé, Wei Cheng, Sylvain Guilley, Olivier Rioul. Bent Sequences over Hadamard Codes for Physically Unclonable Functions. 2021 IEEE International Symposium on Information Theory (ISIT 2021), Jul 2021, Melbourne, Australia. ⟨hal-03240109⟩



Record views


Files downloads