Equipe Communications numériques collection |
 |
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.
https://hal.archives-ouvertes.fr/hal-03240109
Contributor : Patrick Sol'E Connect in order to contact the contributor
Submitted on : Thursday, May 27, 2021 - 10:32:43 PM
Last modification on : Tuesday, January 18, 2022 - 12:24:01 PM
Long-term archiving on: : Saturday, August 28, 2021 - 8:19:07 PM
Contributor : Patrick Sol'E Connect in order to contact the contributor
Submitted on : Thursday, May 27, 2021 - 10:32:43 PM
Last modification on : Tuesday, January 18, 2022 - 12:24:01 PM
Long-term archiving on: : Saturday, August 28, 2021 - 8:19:07 PM
File
21_isit_entropy_puf.pdf
Files produced by the author(s)