Multipath PA-PUFs generate all Boolean functions

DOI10.1007/S10623-026-01861-7MaRDI QIDQ7254957zbMATH OpenFDO

Authors R. Radheshwar, Dibyendu Roy, Pantelimon Stanica

Publication date 29 May 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-026-01861-7

zbMATH Keywords

Boolean functiondelaydistributionPA-PUF

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites work

• Analysis of the strict avalanche criterion in variants of arbiter-based physically unclonable functions
• How do the arbiter PUFs sample the Boolean function class?
• Priority arbiter PUF: analysis
• The gap between promise and reality: on the insecurity of XOR arbiter PUFs
• The glitch PUF: a new delay-PUF architecture exploiting glitch shapes

This page was built for publication: Multipath PA-PUFs generate all Boolean functions

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