Patrick Schaumont

Suggest Changes
Ingrid M. Verbauwhede162
Stefan Mangard52
Kazuo Sakiyama51
Christof Paar51
Elisabeth Oswald46
108Ingrid Verbauwhede
37Serge Vernalde
33Kris Gaj
27Jens-Peter Kaps
26Gang Qu

Filter Results:

  • Full text PDF available (175)

Publication Year

1995
2017
  • This year (5)
  • Last 5 years (71)
  • Last 10 years (136)

Publication Type

Co-author

Journals and Conferences

Data Set Used

Key Phrases

Learn More
A large scale characterization of RO-PUF
To validate the effectiveness of a Physical Unclonable Function (PUF), it needs to be characterized over a large population of chips. Though simulation methods can provide approximate results, an on-chip experiment produces more accurate result. In this paper, we characterize a PUF based on ring oscillator (RO) using a significantly large population of 125… (More)
Improved Ring Oscillator PUF: An FPGA-friendly Secure Primitive
In this paper, we analyze ring oscillator (RO) based physical unclonable function (PUF) on FPGAs. We show that the systematic process variation adversely affects the ability of the RO-PUF to generate unique chip-signatures, and propose a compensation method to mitigate it. Moreover, a configurable ring oscillator (CRO) technique is proposed to reduce noise… (More)
Improving the quality of a Physical Unclonable Function using configurable Ring Oscillators
A silicon Physical Unclonable Function (PUF), which is a die-unique challenge-response function, is an emerging hardware primitive for secure applications. It exploits manufacturing process variations in a die to generate unique signatures out of a chip. This enables chip authentication and cryptographic key generation. A Ring Oscillator (RO) based PUF is a… (More)
A new algorithm for elimination of common subexpressions
—The problem of an efficient hardware implementation of multiplications with one or more constants is encountered in many different digital signal-processing areas, such as image processing or digital filter optimization. In a more general form, this is a problem of common subexpression elimination, and as such it also occurs in compiler optimization and… (More)
Secure FPGA circuits using controlled placement and routing
In current Field-Programmable-Logic Architecture (FPGA) design flows, it is very hard to control the routing of submodules. It is thus very hard to make an identical copy of an existing circuit within the same FPGA fabric. We have solved this problem in a way that still enables us to modify the logic function of the copied sub-module. Our technique has… (More)
A Methodology and Design Environment for DSP ASIC Fixed-Point Refinement
Complex signal processing algorithms are specified in floating point precision. When their hardware implementation requires fixed point precision, type refinement is needed. The paper presents a methodology and design environment for this quantization process. The method uses independent strategies for fixing MSB and LSB weights of fixed point signals. It… (More)
A Hardware-Software Partitioning and Scheduling Algorithm for Dynamically Reconfigurable Embedded Systems
— Dynamically reconfigurable embedded systems (DRESs) target an architecture consisting of general-purpose processors and field programmable gate arrays (FPGAs), in which FPGAs can be reconfigured in run-time to achieve cost saving. In this paper, we describe a hardware-software partitioning and scheduling approach for DRESs. Previous work only took… (More)
An Analysis of Delay Based PUF Implementations on FPGA
Physical Unclonable Functions promise cheap, efficient, and secure identification and authentication of devices. In FPGA devices, PUFs may be instantiated directly from FPGA fabric components in order to exploit the propagation delay differences of signals caused by manufacturing process variations. Multiple delay based PUF architec-tures have been… (More)
A Systematic Method to Evaluate and Compare the Performance of Physical Unclonable Functions
In this work, we propose a systematic method to evaluate and compare the performance of Physical Unclonable Functions (PUFs). The need for such a method is justified by the fact that various types of PUFs have been proposed so far. However, there is no common method that can fairly compare them in terms of their performances. We first propose three generic… (More)