Challenge codes for physically unclonable functions with gaussian delays: A maximum entropy problem

Alexander Schaub; Olivier Rioul; Jean Luc Danger; Sylvain Guilley; Joseph Boutros

doi:10.3934/amc.2020060

Challenge codes for physically unclonable functions with gaussian delays: A maximum entropy problem

Alexander Schaub, Olivier Rioul, Jean Luc Danger, Sylvain Guilley, Joseph Boutros

Research output: Contribution to journal › Article › peer-review

Abstract

Motivated by a security application on physically unclonable functions, we evaluate the probability distributions and Rényi entropies of signs of scalar products of i.i.d. Gaussian random variables against binary codewords in {±1}ⁿ. The exact distributions are determined for small values of n and upper bounds are provided by linking this problem to the study of Boolean threshold functions. Finally, Monte-Carlo simulations are used to approximate entropies up to n = 10.

Original language	English
Pages (from-to)	491-505
Number of pages	15
Journal	Advances in Mathematics of Communications
Volume	14
Issue number	3
DOIs	https://doi.org/10.3934/amc.2020060
Publication status	Published - 1 Aug 2020

Keywords

Boolean threshold functions
Entropy
Multivariate Gaussian distribution

Access to Document

10.3934/amc.2020060

Cite this

@article{d6ed0f934ecf405c94eec9adeb59d6d4,

title = "Challenge codes for physically unclonable functions with gaussian delays: A maximum entropy problem",

abstract = "Motivated by a security application on physically unclonable functions, we evaluate the probability distributions and R{\'e}nyi entropies of signs of scalar products of i.i.d. Gaussian random variables against binary codewords in \{±1\}n. The exact distributions are determined for small values of n and upper bounds are provided by linking this problem to the study of Boolean threshold functions. Finally, Monte-Carlo simulations are used to approximate entropies up to n = 10.",

keywords = "Boolean threshold functions, Entropy, Multivariate Gaussian distribution",

author = "Alexander Schaub and Olivier Rioul and Danger, \{Jean Luc\} and Sylvain Guilley and Joseph Boutros",

year = "2020",

month = aug,

day = "1",

doi = "10.3934/amc.2020060",

language = "English",

volume = "14",

pages = "491--505",

journal = "Advances in Mathematics of Communications",

issn = "1930-5346",

number = "3",

}

TY - JOUR

T1 - Challenge codes for physically unclonable functions with gaussian delays

T2 - A maximum entropy problem

AU - Schaub, Alexander

AU - Rioul, Olivier

AU - Danger, Jean Luc

AU - Guilley, Sylvain

AU - Boutros, Joseph

PY - 2020/8/1

Y1 - 2020/8/1

N2 - Motivated by a security application on physically unclonable functions, we evaluate the probability distributions and Rényi entropies of signs of scalar products of i.i.d. Gaussian random variables against binary codewords in {±1}n. The exact distributions are determined for small values of n and upper bounds are provided by linking this problem to the study of Boolean threshold functions. Finally, Monte-Carlo simulations are used to approximate entropies up to n = 10.

AB - Motivated by a security application on physically unclonable functions, we evaluate the probability distributions and Rényi entropies of signs of scalar products of i.i.d. Gaussian random variables against binary codewords in {±1}n. The exact distributions are determined for small values of n and upper bounds are provided by linking this problem to the study of Boolean threshold functions. Finally, Monte-Carlo simulations are used to approximate entropies up to n = 10.

KW - Boolean threshold functions

KW - Entropy

KW - Multivariate Gaussian distribution

U2 - 10.3934/amc.2020060

DO - 10.3934/amc.2020060

M3 - Article

AN - SCOPUS:85088052201

SN - 1930-5346

VL - 14

SP - 491

EP - 505

JO - Advances in Mathematics of Communications

JF - Advances in Mathematics of Communications

IS - 3

ER -

Challenge codes for physically unclonable functions with gaussian delays: A maximum entropy problem

Abstract

Keywords

Access to Document

Fingerprint

Cite this