Digital bimodal function: An ultra-low energy security primitive

Proceedings of the Tenth ACM/IEEE Symposium on Architectures for Networking and Communications Systems

2014

Self Cite

Small form, mobile, and remote sensor network systems require secure and ultralow power data collection and communication solutions due to their energy constraints. The physical unclonable function (PUF) has emerged as a popular modern low power security primitive. However, current designs are analog in nature and susceptible to instability and difficult to integrate into existing circuitry. In this paper, we present the digital PUF which is stable in the same sense that digital logic is stable, has a very small footprint and very small timing overhead, and can be easily integrated into existing designs. We demonstrate the use of the digital PUF on two applications that are crucial for sensor networks: trusted remote sensing and logic obfuscation. We present our security analysis using standard randomness tests and confusion and diffusion analysis, and apply our new obfuscation approach on a set of standard design benchmarks.

Section: Related Workmentioning

confidence: 99%

Section: Digital Bimodal Functionmentioning

confidence: 99%

Section: Digital Bimodal Functionmentioning

confidence: 99%

See 1 more Smart Citation

Secure remote sensing and communication using digital pufs

Wendt

Proceedings of the Tenth ACM/IEEE Symposium on Architectures for Networking and Communications Systems

2014

Self Cite

“…Sklavos discussed incorporating PUFs into security primitives as well as generating keys for cryptographic devices [19].…”

Section: B Physical Unclonable Functionsmentioning

confidence: 99%

A secure and unclonable embedded system using instruction-level PUF authentication

Zheng

2014 24th International Conference on Field Programmable Logic and Applications (FPL)

2014

Self Cite

In this paper we present a secure and unclonable embedded system design that can target either an FPGA or an ASIC technology. The premise of the security is that the executed machine code and the executing environment (the embedded processor) will authenticate each other at a per-instruction basis using Physical Unclonable Functions (PUFs) that are built into the processor. The PUFs ensure that the execution of the binary code may only proceed if the binary is compiled with the correct intrinsic knowledge of the PUFs, and that such intrinsic knowledge is virtually unique to each processor and therefore unclonable. We will explain how to implement and integrate the PUFs into the processor's execution environment such that each instruction is authenticated and de-obfuscated on-demand and how to transform an ordinary binary executable into PUF-aware, obfuscated binaries. We will also present a prototype system on a Xilinx Spartan6-based FPGA board.

“…While it is often the case that the size and security of the PPUF scale in tandem, the larger the PPUF is, the harder it becomes to simulate and thus, the longer the authentication time grows. Attempts to attenuate this disparity in communication latencies include matched quantized PPUF solutions and digital bimodal functions [6] [7].…”

Section: Introductionmentioning

confidence: 99%

The bidirectional polyomino partitioned PPUF as a hardware security primitive

Wendt

2013 IEEE Global Conference on Signal and Information Processing

2013

Self Cite

Abstract-Physical unclonable functions (PUFs) have demonstrated great potential as fast and robust hardware security primitives. Public physical unclonable functions (PPUFs) have removed the main conceptual limitations of PUFs by enabling the creation of public key protocols. Traditional methods of constructing PPUFs leverage intrinsic process variation in submicron integrated circuits. However, these implementations impose high power usage and require long simulation times, producing high latency protocols. We propose to use next generation CMOScompatible technologies, such as memristors and nanowires, whose components exhibit non-linear circuit characteristics, for the creation of PPUFs. We utilize the bidirectional nature of these components and introduce a novel architecture of PPUF polyomino partitioning. Furthermore, we present new security protocols that authenticate orders of magnitude faster than their CMOS-based PPUF counterparts. We simulate the design and demonstrate its resilience to a host of attacks using SPICE circuit simulation.