Bent Sequences over Hadamard Codes for Physically Unclonable Functions - Département Communications et Electronique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Bent Sequences over Hadamard Codes for Physically Unclonable Functions

Résumé

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.
Fichier principal
Vignette du fichier
21_isit_entropy_puf.pdf (877.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03240109 , version 1 (27-05-2021)

Identifiants

  • HAL Id : hal-03240109 , version 1

Citer

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⟩
152 Consultations
118 Téléchargements

Partager

Gmail Facebook X LinkedIn More