How do the arbiter PUFs sample the Boolean function class?

DOI10.1007/978-3-030-99277-4_6MaRDI QIDQ6618585

Subhamoy Maitra, Animesh Roy, Dibyendu Roy

Publication date: 14 October 2024

zbMATH Keywords

biasBoolean functionpseudorandomnessrestricted domainnon-uniformityphysically unclonable function (PUF)

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (94D10) Computer science (68-XX)

Cites Work

• The gap between promise and reality: on the insecurity of XOR arbiter PUFs
• Tools in analyzing linear approximation for Boolean functions related to FLIP
• On the nonlinearity of Boolean functions with restricted input
• Analysis of the strict avalanche criterion in variants of arbiter-based physically unclonable functions
• Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
• Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
• Physically Uncloneable Functions in the Universal Composition Framework
• Analysis on Boolean Function in a Restricted (Biased) Domain
• Secure Lightweight Entity Authentication with Strong PUFs: Mission Impossible?

Related Items (1)

Priority arbiter PUF: analysis

This page was built for publication: How do the arbiter PUFs sample the Boolean function class?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618585)