Bent Sequences over Hadamard Codes for Physically Unclonable Functions

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.

[1]  Olivier Rioul,et al.  Entropy Estimation of Physically Unclonable Functions via Chow Parameters , 2019, 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  S. Agaian.  Hadamard Matrices and Their Applications , 1985 .

[3]  Marcel J. M. Pelgrom,et al.  Matching properties of MOS transistors , 1989 .

[4]  Sylvain Guilley,et al.  Challenge codes for physically unclonable functions with Gaussian delays: A maximum entropy problem , 2018, Adv. Math. Commun..

[5]  K. Williams,et al.  Gauss and Jacobi sums , 2021, Mathematical Surveys and Monographs.

[6]  Sylvain Guilley,et al.  An Easy-to-Design PUF Based on a Single Oscillator: The Loop PUF , 2012, 2012 15th Euromicro Conference on Digital System Design.

[7]  Sylvain Guilley,et al.  On the entropy of Physically Unclonable Functions , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[8]  G. Edward Suh,et al.  Physical Unclonable Functions for Device Authentication and Secret Key Generation , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[9]  Daniel E. Holcomb,et al.  Power-Up SRAM State as an Identifying Fingerprint and Source of True Random Numbers , 2009, IEEE Transactions on Computers.

[10]  Sylvain Guilley,et al.  The Big Picture of Delay-PUF Dependability , 2020, 2020 European Conference on Circuit Theory and Design (ECCTD).

[11]  H. Iwaniec,et al.  Analytic Number Theory , 2004 .

[12]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[13]  J. Dillon.  Elementary Hadamard Difference Sets , 1974 .

[14]  Gérard D. Cohen,et al.  Covering radius - Survey and recent results , 1985, IEEE Trans. Inf. Theory.

[15]  Kai-Uwe Schmidt,et al.  Asymptotically optimal Boolean functions , 2017, J. Comb. Theory, Ser. A.

[16]  Srinivas Devadas,et al.  Silicon physical random functions , 2002, CCS '02.

[17]  Boris Skoric,et al.  Entropy Estimation for Optical PUFs Based on Context-Tree Weighting Methods , 2007 .

[18]  Elwyn R. Berlekamp,et al.  Weight distributions of the cosets of the (32, 6) Reed-Muller code , 1972, IEEE Trans. Inf. Theory.