In this rst section, we explain three cryptographic primitives: symmetric cryptography,
asymmetric cryptography, and hash functions. Most, if not all, cryptographic protocols require …

With the proliferation of physical attacks that may compromise even the theoretically
strongest cryptographic schemes, the need for affordable physical protection of …

We present PUFKY: a practical and modular design for a cryptographic key generator based
on a Physically Unclonable Function (PUF). A fully functional reference implementation is …

For data storage and protection, encryption is an important standard. A secret key is required
in order to encrypt or decrypt data. This key is typically located in memory, where it can …

When the applied PUF in a PUF-based key generator does not produce full entropy
responses, information about the derived key material is leaked by code-offset helper data. If …

The cryptographic protocols that we use in everyday life rely on the secure storage of keys in
consumer devices. Protecting these keys from invasive attackers, who open a device to steal …

We describe a novel and efficient method to reliably provision and re-generate a finite and
exact sequence of bits, for use with cryptographic applications, eg, as a key, by employing …

A lightweight and secure key storage scheme using silicon Physical Unclonable Functions
(PUFs) is described. To derive stable PUF bits from chip manufacturing variations, a …

In recent years, PUF-based schemes have not only been suggested for the basic security
tasks of tamper sensitive key storage or system identification, but also for more complex …

An important building block for many cryptographic systems is a random number generator.
Random numbers are required in these systems, because they are unpredictable for …