On the Learnability of Physically Unclonable Functions

101 Pages·2018·4.178 MB·English

by  Fatemeh Ganji

T-Labs Series in Telecommunication Services
Fatemeh Ganji
On the
Learnability
of Physically
Unclonable
Functions
T-Labs Series in Telecommunication Services
Series editors
Sebastian Möller, Berlin, Germany
Axel Küpper, Berlin, Germany
Alexander Raake, Berlin, Germany
More information about this series at http://www.springer.com/series/10013
Fatemeh Ganji
On the Learnability
of Physically Unclonable
Functions
123
FatemehGanji
Institut für Softwaretechnik
undTheoretische Informatik
Technischen UniversitätBerlin
Berlin
Germany
ISSN 2192-2810 ISSN 2192-2829 (electronic)
T-Labs Series in Telecommunication Services
ISBN978-3-319-76716-1 ISBN978-3-319-76717-8 (eBook)
https://doi.org/10.1007/978-3-319-76717-8
LibraryofCongressControlNumber:2018933485
©SpringerInternationalPublishingAG2018
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpart
of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations,
recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission
orinformationstorageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilar
methodologynowknownorhereafterdeveloped.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this
publicationdoesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfrom
therelevantprotectivelawsandregulationsandthereforefreeforgeneraluse.
The publisher, the authors and the editors are safe to assume that the advice and information in this
book are believed to be true and accurate at the date of publication. Neither the publisher nor the
authorsortheeditorsgiveawarranty,expressorimplied,withrespecttothematerialcontainedhereinor
for any errors or omissions that may have been made. The publisher remains neutral with regard to
jurisdictionalclaimsinpublishedmapsandinstitutionalaffiliations.
Printedonacid-freepaper
ThisSpringerimprintispublishedbytheregisteredcompanySpringerInternationalPublishingAG
partofSpringerNature
Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland
Dedicated to my mother, my sister, and
the memory of my father.
List of Publications Related to this Thesis
The primary results presented in this thesis have been first published in the fol-
lowing papers:
(cid:129) Ganji, F., Tajik, S., Fäßler, F., Seifert, J.P.: Having No Mathematical Model
MayNotSecurePUFs.JournalofCryptographicEngineering,Springer-Verlag,
2017
(cid:129) Ganji, F., Tajik, S., Fäßler, F., Seifert, J.P.: Strong Machine Learning Attack
Against PUFs with No Mathematical Model. In Proceedings of 18th
InternationalConferenceonCryptographicHardwareandEmbeddedSystems—
CHES 2016, Santa Barbara, USA
(cid:129) Ganji, F., Tajik, S., Seifert, J.P.: Let Me Prove It to You: RO PUFs Are
ProvablyLearnable.InProceedingsof18thAnnualInternationalConferenceon
Information Security and Cryptology (ICISC), 2015, Busan, South Korea
(cid:129) Ganji, F., Tajik, S., Seifert, J.-P.: Why Attackers Win: On the Learnability of
XORArbiterPUFs.InProceedingsof8thInternationalConferenceonTrustand
Trustworthy Computing—TRUST 2015, Heraklion, Greece
(cid:129) Ganji, F., Tajik, S., Seifert, J.P.: PAC Learning of Arbiter PUFs. Journal of
CryptographicEngineering,Springer-Verlag, 2016
In addition to the aforementioned papers, Fatemeh Ganji has co-/authored the
following publications:
(cid:129) Ganji, F., Krämer, J., Seifert, J.P., Tajik, S.: Lattice Basis Reduction Attack
against Physically Unclonable Functions. In Proceedings of 22nd ACM
Conference on Computer and Communications Security—CCS 2015, Denver,
USA
(cid:129) Tajik, S., Lohrke, H., Ganji, F., Seifert, J.P., Boit, C.: Laser Fault Attack on
Physically Unclonable Functions. In Proceedings of Workshop on Fault
Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2015, St. Malo,
France
vii
Contents
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1.1 Hardware Root of Trust. . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.1.2 Fragile Security of ICs. . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 Physically Unclonable Functions . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.3 Thesis Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.3.1 Problem Statement. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.3.2 Our Attack Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.3.3 Thesis Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
1.4 Outline of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2 Definitions and Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.1 Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.2 PUFs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.3 Boolean Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2.3.1 Linearity of Boolean Functions. . . . . . . . . . . . . . . . . . . . . 12
2.3.2 Average Sensitivity of Boolean Functions. . . . . . . . . . . . . 13
2.3.3 Non-linearity of PUFs over F and the Existence
2
of Influential Bits. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
2.4 Linear Threshold Functions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
2.5 Regular Language and Principles of DFAs. . . . . . . . . . . . . . . . . . 17
2.6 Probably Approximately Correct Model. . . . . . . . . . . . . . . . . . . . 18
3 PAC Learning of Arbiter PUFs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
3.2 Representing Arbiter PUFs by DFAs. . . . . . . . . . . . . . . . . . . . . . 23
3.2.1 Discretization Process of Delay Values. . . . . . . . . . . . . . . 25
3.2.2 Building a DFA Representing an Arbiter PUF. . . . . . . . . . 26
3.3 PAC Learning of Arbiter PUFs . . . . . . . . . . . . . . . . . . . . . . . . . . 29
3.4 Comparison with Related Work. . . . . . . . . . . . . . . . . . . . . . . . . . 32
ix
x Contents
3.5 Practical Considerations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
3.5.1 The Important Role of M. . . . . . . . . . . . . . . . . . . . . . . . . 33
3.5.2 Dealing with the Metastable Condition . . . . . . . . . . . . . . . 34
4 PAC Learning of XOR Arbiter PUFs. . . . . . . . . . . . . . . . . . . . . . . . 35
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
4.2 LTF Representation of XOR Arbiter PUFs. . . . . . . . . . . . . . . . . . 37
4.3 PAC Learning of XOR Arbiter PUFs . . . . . . . . . . . . . . . . . . . . . 39
4.4 PAC Learning of Noisy XOR Arbiter PUFs. . . . . . . . . . . . . . . . . 43
4.5 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
4.5.1 Theoretical Considerations . . . . . . . . . . . . . . . . . . . . . . . . 44
4.5.2 Practical Considerations . . . . . . . . . . . . . . . . . . . . . . . . . . 46
5 PAC Learning of Ring Oscillator PUFs . . . . . . . . . . . . . . . . . . . . . . 49
5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
5.2 DL Representation of RO-PUFs . . . . . . . . . . . . . . . . . . . . . . . . . 51
5.3 PAC Learnability of the 2(cid:1)DL Representing the RO-PUF . . . . . 53
5.4 Results and Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
6 PAC Learning of Bistable Ring PUFs. . . . . . . . . . . . . . . . . . . . . . . . 59
6.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
6.2 Architecture of the BR-PUF Family. . . . . . . . . . . . . . . . . . . . . . . 61
6.3 A Constant Upper Bound on the Number of Influential Bits . . . . . 62
6.3.1 Heuristic Approaches. . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
6.3.2 A Boolean-Analytical Approach. . . . . . . . . . . . . . . . . . . . 64
6.4 PAC Learning of PUFs Without Prior Knowledge of Their
Mathematical Model. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
6.5 Results and Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68
7 Follow-Up Work. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
7.1 Lattice Basis Reduction Attack . . . . . . . . . . . . . . . . . . . . . . . . . . 73
7.2 Laser Fault Injection Attack . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74
8 Conclusion and Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
References.... .... .... .... ..... .... .... .... .... .... ..... .... 81
Acronyms
AdaBoost Adaptive Boosting
BR Bistable Ring
CRP Challenge-Response Pair
DFA Deterministic Finite Automata
DL Decision List
DT Decision Tree
EM ElectroMagnetic
FPGA Field-Programmable Gate Array
GHz Gigahertz
IC Integrated Circuit
IoT Internet of Things
IP Intellectual Property
LR Logistic Regression
LTF Linear Threshold Function
ML Machine Learning
NIST National Institute of Standard and Technology
nm Nanometer
PAC Probably Approximately Correct
PDF Probability Density Function
PLD Programmable Logic Devices
ps Picosecond
PUF Physically Unclonable Function
RO Ring Oscillator
RoT Root of Trust
SAC Strict Avalanche Criterion
TBR Twisted Bistable Ring
UART Universal Asynchronous Receiver/Transmitter (UART)
XOR Exclusive-OR
xi