Saved in:
Bibliographic Details
Main Authors: Garrard, Jack, Hardy II, John F., daCunha, Carlo, Bakshi, Mayank
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2510.02643
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918159106179072
author Garrard, Jack
Hardy II, John F.
daCunha, Carlo
Bakshi, Mayank
author_facet Garrard, Jack
Hardy II, John F.
daCunha, Carlo
Bakshi, Mayank
contents Physically Unclonable Functions (PUFs) are a promising solution for identity verification and asymmetric encryption. In this paper, a new Resistive Random Access Memory (ReRAM) PUF-based protocol is presented to create a physical ReRAM PUF with a large challenge space. This protocol uses differential reads from unformed ReRAM as the method for response generation. Lastly, this paper also provides an experimental hardware demonstration of this protocol on a Physical ReRAM device, along with providing notable results as a PUF, with excellent performance characteristics.
format Preprint
id arxiv_https___arxiv_org_abs_2510_02643
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Using Preformed Resistive Random Access Memory to Create a Strong Physically Unclonable Function
Garrard, Jack
Hardy II, John F.
daCunha, Carlo
Bakshi, Mayank
Cryptography and Security
Physically Unclonable Functions (PUFs) are a promising solution for identity verification and asymmetric encryption. In this paper, a new Resistive Random Access Memory (ReRAM) PUF-based protocol is presented to create a physical ReRAM PUF with a large challenge space. This protocol uses differential reads from unformed ReRAM as the method for response generation. Lastly, this paper also provides an experimental hardware demonstration of this protocol on a Physical ReRAM device, along with providing notable results as a PUF, with excellent performance characteristics.
title Using Preformed Resistive Random Access Memory to Create a Strong Physically Unclonable Function
topic Cryptography and Security
url https://arxiv.org/abs/2510.02643