Strong machine learning attack against PUFs with no mathematical model

DOI10.1007/978-3-662-53140-2_19MaRDI QIDQ1695981zbMATH OpenOpenAlexFDO

Authors Fatemeh Ganji, Shahin Tajik, Fabian Fäßler, Jean-Pierre Seifert

Publication date 14 February 2018

Full work available at URL https://doi.org/10.1007/978-3-662-53140-2_19

zbMATH Keywords

machine learningFourier analysisPAC learningboosting techniquephysically unclonable functions (PUFs)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Recommendations

• Let me prove it to you: RO PUFs are provably learnable
• A Fourier analysis based attack against physically unclonable functions
• The gap between promise and reality: on the insecurity of XOR arbiter PUFs
• Efficient power and timing side channels for physical unclonable functions
• A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model

Cited in

(5)

• A Fourier analysis based attack against physically unclonable functions
• Let me prove it to you: RO PUFs are provably learnable
• A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model
• Formal analysis of PUF instances leveraging correlation-spectra in Boolean functions
• A PUF and software collaborative key protection scheme

This page was built for publication: Strong machine learning attack against PUFs with no mathematical model

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