# US 2026/0065644 A1 · DETECTION OF STEALTHY BITSTREAMS IN FIELD PROGRAMMABLE GATE ARRAYS (FPGAs)

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0065644 A1
- Document ID: US20260065644A1
- Status: Published application
- Kind: A1
- Application number: 19/313,207
- Filed: 2025-08-28
- Published: 2026-03-05
- Earliest claimed: 2024-08-29
- Assignees: Arizona Board of Regents on behalf of Arizona State University
- Inventors: Jayeeta Chaudhuri; Krishnendu Chakrabarty
- Web page: https://patentgrep.com/patent/US20260065644A1

## CPC

- G06V 10/764: using classification, e.g. of video objects
- G06F 21/76: in application-specific integrated circuits [ASIC] or field-programmable devices, e.g. field-programmable gate arrays [FPGA] or programmable logic devices [PLD]
- G06N 3/045: Combinations of networks
- G06N 3/0464: Convolutional networks [CNN, ConvNet]
- G06N 3/048: Activation functions
- G06N 3/063: using electronic means
- G06N 3/08: Learning methods
- G06N 3/09: Supervised learning
- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06N 20/10: using kernel methods, e.g. support vector machines [SVM]
- G06T 5/10: using non-spatial domain filtering
- G06T 7/11: Region-based segmentation
- G06V 10/426: Graphical representations
- G06V 10/60: relating to illumination properties, e.g. using a reflectance or lighting model
- G06V 10/761: {Proximity, similarity or dissimilarity measures}
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

A method of detecting stealthy bitstreams in field programmable gate arrays (FPGAs) includes receiving an FPGA bitstream for configuring an FPGA; converting the FPGA bitstream into images; generating a graph from the images using a similarity evaluation; and performing a classification of the FPGA bitstream as benign or malicious using the graph as input to a graph convolutional network.

## Claims

### Claim 1

A method of detecting stealthy bitstreams in field programmable gate arrays (FPGAs), comprising:
receiving an FPGA bitstream for configuring an FPGA;
converting the FPGA bitstream into images;
generating a graph from the images using a similarity evaluation; and
performing a classification of the FPGA bitstream as benign or malicious using the graph as input to a graph convolutional network.

### Claim 2 (depends on 1)

The method of claim 1, wherein converting the FPGA bitstream into images comprises:
partitioning the FPGA bitstream into non-overlapping windows; and
converting each bitstream window of the non-overlapping windows of the FPGA bitstream to an image.

### Claim 3 (depends on 2)

The method of claim 2, wherein partitioning the FPGA bitstream into non-overlapping windows comprises:
using a support vector machine to determine an optimal number of windows.

### Claim 4 (depends on 2)

The method of claim 2, further comprising:
reducing dimensionality of the non-overlapping windows of the FPGA bitstream.

### Claim 5 (depends on 4)

The method of claim 4, wherein reducing dimensionality of the non-overlapping windows of the FPGA bitstream comprises:
inputting the non-overlapping windows of the FPGA bitstream to a convolutional neural network.

### Claim 6 (depends on 1)

The method of claim 1, wherein generating a graph from the images using a similarity evaluation comprises:
assigning each image as a node of the graph;
obtaining a similarity value between image pairs of the images; and
adding an edge between the two nodes corresponding to the two images of each image pair having the similarity value above a threshold.

### Claim 7 (depends on 6)

The method of claim 6, wherein the similarity value is based on a comparison of features including luminance, contrast, and structure.

### Claim 8 (depends on 6)

The method of claim 6, wherein the similarity value is a structural similarity index (SSIM) value calculated as:
SSIM
⁡
(
Im
i
,
Im
j
)
=
(
2
⁢
μ
Im
i
⁢
μ
Im
j
+
(
k
1
⁢
l
)
2
)
⁢
(
2
⁢
σ
Im
i
,
Im
j
+
(
k
2
⁢
l
)
2
)
(
μ
Im
i
2
+
μ
Im
j
2
+
k
1
⁢
l
)
⁢
(
σ
Im
i
2
+
σ
Im
j
2
+
k
2
⁢
l
)
wherein Imi is an image of a corresponding bitstream window, wherein (Imi, Imj) is the image pair given 1≤i, j≤total number of windows, and i≠j, wherein μImi and μImj indicate the mean pixel value of Imi and Imj, respectively, wherein
σ
Im
i
2
⁢
and
⁢
σ
Im
j
2
indicate the variance of Imi and Imj, respectively, wherein σImi,Imj is the covariance of the image pair, wherein l is the range of the pixel values, and wherein k1 and k2 are predetermined values.

### Claim 9 (depends on 1)

The method of claim 1, wherein performing the classification of the FPGA bitstream as benign or malicious using the graph as input to the graph convolutional network comprises:
generating node embeddings from the graph using a graph convolutional network having a feature vector generated at least from applying a Fast Fourier Transform on each bitstream window; and
performing machine learning inference on the node embeddings.

### Claim 10 (depends on 9)

The method of claim 9, wherein the feature vector further comprises a feature set generated from inputting the bitstream windows to a convolutional neural network.

### Claim 11 (depends on 9)

The method of claim 9, wherein performing machine learning inference on the node embeddings comprises:
inputting the node embeddings to multilayer perceptron.

### Claim 12 (depends on 1)

The method of claim 1, wherein the FPGA bitstream comprises dispersed malicious circuits having inverters of ring oscillator circuits distributed across multiple non-contiguous look-up tables (LUTs) of the FPGA, the method comprising classifying the FPGA bitstream as malicious.

### Claim 13

A system for detecting stealthy bitstreams in field programmable gate arrays (FPGAs), comprising:
a convolutional neural network (CNN);
a graph convolutional network (GCN);
a multilayer perceptron (MLP);
one or more processors;
memory; and
instructions for detecting stealthy bitstreams in FPGAs stored in the memory that when executed by at least one of the one or more processors direct the system to:
receive an FPGA bitstream for configuring an FPGA;
partition the FPGA bitstream into non-overlapping windows;
input the non-overlapping windows of the FPGA bitstream to the CNN to generate a first feature set;
convert each bitstream window of the non-overlapping windows of the FPGA bitstream to an image;
generate a graph from the images using a similarity evaluation;
generate node embeddings from the graph using the GCN having a feature vector comprising a combination of the first feature set and a second feature set generated from applying a Fast Fourier Transform on each bitstream window; and
perform machine learning inference on the node embeddings using the MLP to classify the FPGA bitstream as benign or malicious.

### Claim 14 (depends on 13)

The system of claim 13, wherein instructions to generate the graph from the images using the similarity evaluation direct the system to:
assign each image as a node of the graph;
obtain a structural similarity index value between image pairs of the images; and
add an edge between the two nodes corresponding to the two images of each image pair having the structural similarity index value above a threshold.

### Claim 15 (depends on 14)

The system of claim 14, wherein the structural similarity index value is based on a comparison of features including luminance, contrast, and structure.

### Claim 16 (depends on 14)

The system of claim 14, wherein the structural similarity index (SSIM) value is calculated as:
SSIM
⁡
(
Im
i
,
Im
j
)
=
(
2
⁢
μ
Im
i
⁢
μ
Im
j
+
(
k
1
⁢
l
)
2
)
⁢
(
2
⁢
σ
Im
i
,
Im
j
+
(
k
2
⁢
l
)
2
)
(
μ
Im
i
2
+
μ
Im
j
2
+
k
1
⁢
l
)
⁢
(
σ
Im
i
2
+
σ
Im
j
2
+
k
2
⁢
l
)
wherein Imi is an image of a corresponding bitstream window, wherein (Imi, Imj) is the image pair given 1≤i, j≤total number of windows, and i≠j, wherein μImi and μImj indicate the mean pixel value of Imi and Imj, respectively, wherein
σ
Im
i
2
⁢
and
⁢
σ
Im
j
2
indicate the variance of Imi and Imj, respectively, wherein σImi,Imj is the covariance of the image pair, wherein l is the range of the pixel values, and wherein k1 and k2 are predetermined values.

### Claim 17

A computer-readable storage medium storing instructions that when executed cause a system to:
receive an FPGA bitstream for configuring an FPGA deployed on a shared FPGA infrastructure;
convert the FPGA bitstream into images;
generate a graph from the images using a similarity evaluation to analyze spatial relationships between bitstream segments;
perform a classification of the FPGA bitstream as benign or malicious using the graph as input to a graph convolutional network;
analyze the FPGA bitstream for dispersed malicious circuits having components distributed across non-contiguous look-up tables based on the classification; and
prevent deployment of the FPGA bitstream on the shared FPGA infrastructure when malicious dispersed circuits are detected.

### Claim 18 (depends on 17)

The computer-readable storage medium of claim 17, wherein instructions to convert the FPGA bitstream into images direct the system to:
partition the FPGA bitstream into non-overlapping windows; and
convert each bitstream window of the non-overlapping windows of the FPGA bitstream to an image.

### Claim 19 (depends on 17)

The computer-readable storage medium of claim 17, wherein instructions to generate the graph from the images using the similarity evaluation direct the system to:
assign each image as a node of the graph;
obtain a structural similarity index value between image pairs of the images; and
add an edge between the two nodes corresponding to the two images of each image pair having the structural similarity index value above a threshold.

### Claim 20 (depends on 17)

The computer-readable storage medium of claim 17, wherein instructions to generate a graph from the images using a similarity evaluation direct the system to:
assign each image as a node of the graph;
obtain a similarity value between image pairs of the images; and
add an edge between the two nodes corresponding to the two images of each image pair having the similarity value above a threshold.
