IP Library › Granted Patent US 11,522,725
Granted Patent B2
US 11,522,725 · App. 16/498,587 · Granted Dec 6, 2022

Reducing amount of helper data in silicon physical unclonable functions via lossy compression without production-time error characterization

Inventors: Michael Orshansky (Austin, TX); Ye Wang (Austin, TX)
Assignee: Board of Regents, The University of Texas System
H04L9/3278G06F21/73H04L9/0866H04L2209/12H04L2209/30H04L2209/34
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,522,725
App. No.
16/498,587
Granted
Dec 6, 2022
Kind
B2
Abstract

A method, system and computer program product for reducing the amount of helper data that needs to be stored using two innovative techniques. The first technique uses bit-error-rate (BER)-aware lossy compression. By treating a fraction of reliable bits as unreliable, it effectively reduces the size of the reliability mask. With the view of practical costs of production-time error characterization, the second technique enables economically feasible across-temperature per-bit BER evaluation for use in a number of fuzzy extractor optimizations based on bit-selection to reduce overall BER (with or without subsequent compression) using room-temperature only production-time characterization. The technique is based on stochastic concentration theory and allows efficiently forming confidence intervals for average across-temperature BER of a selected set of bits. By using these techniques, it is economically feasible to achieve a dramatic reduction in the amount of helper data that needs to be stored in non-volatile memory and/or one-time-programmable memory.

Claims (29)

1. A method for reducing the amount of helper data that needs to be stored, the method comprising:

determining individual cell bit-error-rates of a physical unclonable function;

formulating a lossy compression problem using said determined individual cell bit-error-rates of said physical unclonable function, wherein said lossy compression problem is an integer linear programming problem;

solving said formulated lossy compression problem;

storing a solution to said formulated lossy compression problem as a map representing reliable cells in a memory of a physical unclonable function system;

constructing helper data to be utilized by a fuzzy extractor using said map representing reliable cells and error correction code helper data;

generating a codebook using said determined individual cell bit-error-rates of said physical unclonable function;

formulating said lossy compression problem to seek an optimal mapping from memory segments into codewords in said generated codebook; and

using a Lagrangian relaxation method for solving said integer linear programming problem to reduce a number of bits of said helper data.

2. A computer program product for reducing the amount of helper data that needs to be stored, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising the programming instructions for:

determining individual cell bit-error-rates of a physical unclonable function;

formulating a lossy compression problem using said determined individual cell bit-error-rates of said physical unclonable function, wherein said lossy compression problem is an integer linear programming problem;

solving said formulated lossy compression problem;

storing a solution to said formulated lossy compression problem as a map representing reliable cells in a memory of a physical unclonable function system;

constructing helper data to be utilized by a fuzzy extractor using said map representing reliable cells and error correction code helper data;

generating a codebook using said determined individual cell bit-error-rates of said physical unclonable function;

formulating said lossy compression problem to seek an optimal mapping from memory segments into codewords in said generated codebook; and

using a Lagrangian relaxation method for solving said integer linear programming problem to reduce a number of bits of said helper data.

3. A system, comprising:

a memory unit for storing a computer program for reducing the amount of helper data that needs to be stored; and

a processor coupled to the memory unit, wherein the processor is configured to execute the program instructions of the computer program comprising:

determining individual cell bit-error-rates of a physical unclonable function;

formulating a lossy compression problem using said determined individual cell bit-error-rates of said physical unclonable function, wherein said lossy compression problem is an integer linear programming problem;

solving said formulated lossy compression problem;

storing a solution to said formulated lossy compression problem as a map representing reliable cells in a memory of a physical unclonable function system;

constructing helper data to be utilized by a fuzzy extractor using said map representing reliable cells and error correction code helper data;

generating a codebook using said determined individual cell bit-error-rates of said physical unclonable function;

formulating said lossy compression problem to seek an optimal mapping from memory segments into codewords in said generated codebook; and

using a Lagrangian relaxation method for solving said integer linear programming problem to reduce a number of bits of said helper data.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 27, 2019
From: ORSHANSKY, MICHAEL; WANG, YE
To: BOARD OF REGENTS, THE UNIVERSITY OF TEXAS SYSTEM
Reel/Frame 050513/0158 →
Continuity (3)
Provisional Application 62478130 · Mar 29, 2017
Provisional Application 62478117 · Mar 29, 2017
Related Publication 20200052913A1 · Feb 13, 2020