Abstract
Motivated by a security application on physically unclonable functions, we evaluate the probability distributions and Renyi entropies of signs of scalar products of i.i.d. Gaussian random variables against binary codewords in \begin{document}$ \{\pm1\}^n $\end{document} . The exact distributions are determined for small values of \begin{document}$ n $\end{document} 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 \begin{document}$ n = 10 $\end{document} .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
