HMHolger Mandry

Holger Mandry

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Holger Mandry has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Eye-Opening Arbiter PUF With Auto-Error Detection and PVT-Robust Masking Achieving a BER of 2e -8

    by Bjoern Driemeyer, Holger Mandry, David-Peter Wiens, John G. Kauffman, Joachim Becker, Maurits Ortmanns

    A hybrid ring oscillator (RO)/ arbiter physical unclonable function (PUF) is implemented in a 28-nm CMOS, where two competing ROs accumulate a sufficiently large phase difference exceeding a predefined deadzone (DZ). The resulting eye-opening arbiter (EOA) architecture enables a prediction of PUF bit stability over temperature change (from −40 °C to $125~^{\circ }$ C), supply voltage variation (±10%), and four-year accelerated aging based on a single point measurement at the initial PUFs usage. This once-a-lifetime initialization at nominal conditions generates a blanking mask without disclosing secret PUF information, off-chip or even outside the PUF cells. The EOA architecture additionally features an inherent multi-purpose auto-error detection (AE-Detection), which allows to assess the reliability of every generated PUF bit at every PUF bit readout. Using AE-detection and masking, a bit error rate (BER) of $2 \times 10^{-8}$ over 16 measured devices and a total of $200 \times 10^{6}$ measured bits over environmental changes and aging could be measured. The PUF operates with 0.259 pJ/bit, generates PUF bits with 4.515-Gbit/s bit-rate and only requires $34.84~\mu \text {m}^{2}$ per bit, including all masking and stabilization circuitry, to ensure the low BER PUF performance.

  • Open Access

    The Eye-Opening Arbiter-PUF FPGA Implementation with Auto Error Detection

    by Holger Mandry, Julian Spiess, Bjoern Driemeyer, Joachim Becker, Maurits Ortmanns

    We present the first implementation of an FPGA-based PUF that leverages the usually contradictory requirements of stability and response time. Many state-of-the-art implementations of PUFs are either slow with a low error rate, like the ring oscillator-PUF, or fast with a higher error rate, like the arbiter-PUF. The presented implementation of an eye-opening PUF uses the phase-integrating effect of a ring oscillator to realize the shortest possible response for the required stability of the readout. This principle also allows for new automatic detection of unstable bits based on counting the number of oscillations required until an arbitration is conducted. This first implementation of an eye-opening PUF reduces the bit error rate to a number under our measurement limits, while the readout time is simultaneously kept as low as ≤1.54 μs, with an average of 0.85 μs. In addition, environmental temperature changes are evaluated, and methods for limiting these effects are discussed.


  • Open Access

    Protection of Oscillator-Based PUFs against Side Channel Analyses by Random Interruption

    by Holger Mandry, Jonas Ruchti, Julius Nowakowski, Michael Pehl, Maurits Ortmanns

    Oscillation-based physical unclonable functions (PUFs) are known to be sensitive to power trace side channel analyses (SCAs). Although previous work investigated on countermeasures, these required significant additional amount of hardware or were just able to obscure sign information of a frequency comparison, while the magnitude information remains available to the attacker. As recent innovation on oscillation-based PUFs also require the magnitude-information beside the sign, e.g., to increase the reliability, the need arises to protect both. We present a new protection approach to hide both sign and magnitude information of oscillation-based PUF from an attacker. By introducing random interruptions in the oscillation, the power spectrum is blurred while the quality of the PUF is maintained. In addition to concept simulations and the discussion of different implementations, we use the example of a loop-PUF to show that the presented countermeasure can withstand several attack scenarios.

  • A Multilevel Coding Scheme for Multi-Valued Physical Unclonable Functions

    by Sven Muelich, Holger Mandry, Maurits Ortmanns, Robert F. H. Fischer

    Physical unclonable functions (PUFs) produce responses by exploiting randomness that intrinsically occurs in integrated circuits due to uncontrollable variations in the manufacturing process of physical items. It is common practice that PUFs generate binary responses. Recently, it has been proposed to extract symbols from a higher-order alphabet in order to increase the length of the final response. In this paper, coding for this concept of multi-valued PUFs (MV-PUFs) is derived from the analogy to pulse-amplitude modulation in digital communications. To that end, based on ROPUF measurement data, we replace the classical binary symmetric channel model by a suited additive white Gaussian noise model. Consequently, the hard-input binary channel coding scheme is replaced by methods from coded modulation, utilizing the soft output. In addition, the functionality of helper data, which are required to stabilize noisy PUF responses, is transferred to the multi-valued case. By applying the designed methods to the available measurement data we eventually show that imagining the analog PUF output as $M$ -ary amplitude-shift keying symbols observed over an AWGN channel, both the extracted entropy per response symbol and the reliability of the final key can be increased.


  • Using Polynomial Interpolation for Reproducing Multi-Valued Responses of Physical Unclonable Functions on FPGAs

    by Holger Mandry, Sven Muelich, Joachim Becker, Robert F. H. Fischer, Maurits Ortmanns

    A well-known problem when using Physical Unclonable Functions for secret key generation and storage, is the instability of PUF responses due to environmental conditions like temperature variations. Using Ring Oscillator PUFs (RO-PUFs), a response bit is usually derived based on the comparison of a RO frequency with either a threshold or another RO frequency. Especially for multi-valued PUFs it is of importance to decrease RO frequency errors before digitization. Otherwise, these errors can result in a huge amount of bit-flips. To counteract environmental influence in the reproduction phase, we propose to map a frequency, which might be remeasured under a temperature condition different from initialization, closer to the initial frequency by using a method based on polynomial interpolation. This paper presents how such an approach can decrease errors in multi-valued responses and evaluates the error based on the used polynomial order and thus complexity.


  • Open Access

    Normalization and Multi-Valued Symbol Extraction From RO-PUFs for Enhanced Uniform Probability Distributions

    by Holger Mandry, Andreas Herkle, Sven Muelich, Joachim Becker, Robert F. H. Fischer, Maurits Ortmanns

    Physical Unclonable Functions (PUFs) offer the possibility for on-chip generation of unique fingerprints for integrated circuits. Ring-oscillator (RO) PUFs are small and easy to configure on Field Programmable Gate Arrays (FPGAs) and thus received great attention over the years. In the state-of-the-art two neighboring ROs are compared and mapped to only a single bit of information. Few publications aims to extract more bits out of one PUF-cell, but struggle with non-uniform distributions. In this work multi-valued symbol extraction is presented as a method to extract more bits of information out of each individual RO. A new post-processing approach is introduced to produce close-to-ideal uniformly distributed responses independent of the underlying physically probability distribution. To eliminate bias, caused by placement inequalities, multiple methods of normalization are utilized and analyzed by means of area and complexity. Based on metrics for symbol transmission, the Euclidean-distance and entropy are used as metrics to evaluate the uniqueness and reliability of multi-valued PUFs. This new approach allows to increase the amount of extracted information to 3 bits per RO.