Cryptographic application of physical unclonable functions (PUFs)

Physical Unclonable Functions (PUFs) are circuits designed to extract physical randomness from the underlying circuit. This randomness depends on the manufacturing process. It differs for each device enabling chip-level authentication and key generation applications. This thesis has performed research work about PUF based encryption and low power PUFs. First, we present a protocol utilizing a PUF for secure data transmission. Each party has a PUFused for encryption and decryption; this is facilitated by constraining the PUF to be commutative. This framework is evaluated with a primitive permutation network - a barrel shifter. Physical randomness is derived from the delay of different shift paths. Barrel shifter (BS) PUF captures the delay of different shift paths. This delay is entangled with message bits before they are sent across an insecure channel. BS-PUF is implemented using transmission gates; their characteristics ensure same-chip physical commutativity, a necessary property of PUFs designed for encryption. Post-layout simulations of a common centroid layout 8-level barrel shifter in 0.13μm technology assess uniqueness, stability and randomness properties. BS-PUFs pass all selected NIST statistical randomness tests. Stability similar to Ring Oscillator (RO) PUFs under environment variation is shown. Logistic regression of 100,000 plaintext-ciphertext pairs (PCPs) failed to successfully modelBS-PUF behavior. Then we generalize this encryption protocol to work with PUFs other than theBSPUFs. On the other hand, we further explore some low power techniques for building PUFs. Asymmetric layout improved unit path delay variation by as much as 73.2% and uniqueness problem introduced by asymmetric layout is proved to be solvable through Multi-Block entanglement pat-tern. By adopting these 2 techniques, power and area consumption of PUF can be reduced by as much as 44.29% and 39.7%

A high speed fault-tolerant multimedia network and connectionless gateway for ATM networks.

by Patrick Lam Sze Fan.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Includes bibliographical references (leaves 163-[170]).Chapter 1 --- Introduction --- p.1Chapter 2 --- Fault-tolerant CUM LAUDE NET --- p.7Chapter 2.1 --- Overview of CUM LAUDE NET --- p.7Chapter 2.2 --- Network architecture of CUM LAUDE NET --- p.8Chapter 2.3 --- Design of Router-node --- p.10Chapter 2.3.1 --- Architecture of the Router-node --- p.10Chapter 2.3.2 --- Buffers Arrangement of the Router-node --- p.12Chapter 2.3.3 --- Buffer transmission policies --- p.13Chapter 2.4 --- Protocols of CUM LAUDE NET --- p.14Chapter 2.5 --- Frame Format of CUM LAUDE NET --- p.15Chapter 2.6 --- Fault-tolerant (FT) and Auto-healing (AH) algorithms --- p.16Chapter 2.6.1 --- Overview of the algorithms --- p.16Chapter 2.6.2 --- Network Failure Scenarios --- p.18Chapter 2.6.3 --- Design and Implementation of the Fault Tolerant Algorithm --- p.19Chapter 2.6.4 --- Design and Implementation of the Auto Healing Algorithm --- p.26Chapter 2.6.5 --- Network Management Signals and Restoration Times --- p.27Chapter 2.6.6 --- Comparison of fault-tolerance features of other networks with the CUM LAUDE NET --- p.31Chapter 2.7 --- Chapter Summary --- p.31Chapter 3 --- Overview of the Asynchronous Transfer Mode (ATM) --- p.33Chapter 3.1 --- Introduction --- p.33Chapter 3.2 --- ATM Network Interfaces --- p.34Chapter 3.3 --- ATM Virtual Connections --- p.35Chapter 3.4 --- ATM Cell Format --- p.36Chapter 3.5 --- ATM Address Formats --- p.36Chapter 3.6 --- ATM Protocol Reference Model --- p.38Chapter 3.6.1 --- The ATM Layer --- p.39Chapter 3.6.2 --- The ATM Adaptation Layer --- p.39Chapter 3.7 --- ATM Signalling --- p.44Chapter 3.7.1 --- ATM Signalling Messages and Call Setup Procedures --- p.45Chapter 3.8 --- Interim Local Management Interface (ILMI) --- p.47Chapter 4 --- Issues of Connectionless Gateway --- p.49Chapter 4.1 --- Introduction --- p.49Chapter 4.2 --- The Issues --- p.50Chapter 4.3 --- ATM Internetworking --- p.51Chapter 4.3.1 --- LAN Emulation --- p.52Chapter 4.3.2 --- IP over ATM --- p.53Chapter 4.3.3 --- Comparing IP over ATM and LAN Emulation --- p.59Chapter 4.4 --- Connection Management --- p.61Chapter 4.4.1 --- The Indirect Approach --- p.62Chapter 4.4.2 --- The Direct Approach --- p.63Chapter 4.4.3 --- Comparing the two approaches --- p.64Chapter 4.5 --- Protocol Conversion --- p.65Chapter 4.5.1 --- Selection of Protocol Converter --- p.68Chapter 4.6 --- Packet Forwarding Modes --- p.68Chapter 4.7 --- Bandwidth Assignment --- p.70Chapter 4.7.1 --- Bandwidth Reservation --- p.71Chapter 4.7.2 --- Fast Bandwidth Reservation --- p.72Chapter 4.7.3 --- Bandwidth Advertising --- p.72Chapter 4.7.4 --- Bandwidth Advertising with Cell Drop Detection --- p.73Chapter 4.7.5 --- Bandwidth Allocation on Source Demand --- p.73Chapter 4.7.6 --- The Common Problems --- p.74Chapter 5 --- Design and Implementation of the Connectionless Gateway --- p.77Chapter 5.1 --- Introduction --- p.77Chapter 5.1.1 --- Functions Definition of Connectionless Gateway --- p.79Chapter 5.2 --- Hardware Architecture of the Connectionless Gateway --- p.79Chapter 5.2.1 --- Imposed Limitations --- p.82Chapter 5.3 --- Software Architecture of the Connectionless Gateway --- p.83Chapter 5.3.1 --- TCP/IP Internals --- p.84Chapter 5.3.2 --- ATM on Linux --- p.85Chapter 5.4 --- Network Architecture --- p.88Chapter 5.4.1 --- IP Addresses Assignment --- p.90Chapter 5.5 --- Internal Structure of Connectionless Gateway --- p.90Chapter 5.5.1 --- Protocol Stacks of the Gateway --- p.90Chapter 5.5.2 --- Gateway Operation by Example --- p.93Chapter 5.5.3 --- Routing Table Maintenance --- p.97Chapter 5.6 --- Additional Features --- p.105Chapter 5.6.1 --- Priority Output Queues System --- p.105Chapter 5.6.2 --- Gateway Performance Monitor --- p.112Chapter 5.7 --- Setup an Operational ATM LAN --- p.117Chapter 5.7.1 --- SVC Connections --- p.117Chapter 5.7.2 --- PVC Connections --- p.119Chapter 5.8 --- Application of the Connectionless Gateway --- p.120Chapter 6 --- Performance Measurement of the Connectionless Gateway --- p.121Chapter 6.1 --- Introduction --- p.121Chapter 6.2 --- Experimental Setup --- p.121Chapter 6.3 --- Measurement Tools of the Experiments --- p.123Chapter 6.4 --- Descriptions of the Experiments --- p.124Chapter 6.4.1 --- Log Files --- p.125Chapter 6.5 --- UDP Control Rate Test --- p.126Chapter 6.5.1 --- Results and analysis of the UDP Control Rate Test --- p.127Chapter 6.6 --- UDP Maximum Rate Test --- p.138Chapter 6.6.1 --- Results and analysis of the UDP Maximum Rate Test --- p.138Chapter 6.7 --- TCP Maximum Rate Test --- p.140Chapter 6.7.1 --- Results and analysis of the TCP Maximum Rate Test --- p.140Chapter 6.8 --- Request/Response Test --- p.144Chapter 6.8.1 --- Results and analysis of the Request/Response Test --- p.144Chapter 6.9 --- Priority Queue System Verification Test --- p.149Chapter 6.9.1 --- Results and analysis of the Priority Queue System Verifi- cation Test --- p.150Chapter 6.10 --- Other Observations --- p.153Chapter 6.11 --- Solutions to Improve the Performance --- p.154Chapter 6.12 --- Future Development --- p.157Chapter 7 --- Conclusion --- p.158Bibliography --- p.163A List of Publications --- p.17