MétaCan
Menu
Back to cohort
Record W4414605528 · doi:10.1109/isorc65339.2025.00045

Real-Time Detection of Bitstream Vulnerabilities in FPGAs

2025· article· en· W4414605528 on OpenAlexaff
Mansour Alqarni, Akramul Azim

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPhysical Unclonable Functions (PUFs) and Hardware Security
Canadian institutionsOntario Tech University
Fundersnot available
KeywordsBitstreamField-programmable gate arrayReliability (semiconductor)Vulnerability (computing)SafeguardingCryptography

Abstract

fetched live from OpenAlex

Field-Programmable Gate Arrays (FPGAs) are increasingly used in critical applications and as versatile platforms for research, prototyping, and education. Their reprogrammable nature, however, makes them vulnerable to security threats, particularly through bitstream vulnerabilities. This paper presents a new approach for the real-time detection and mitigation of such vulnerabilities. We introduce BitVulLLM, a fine-tuned variant of LLAMA2 specifically used for FPGA bitstream vulnerability detection. As part of this research, we generated a comprehensive dataset of FPGA bitstreams, including secure and vulnerable configurations, to address the challenges of detecting and rectifying security flaws. Our method not only identifies vulnerabilities with high precision, but also generates secure bitstreams, significantly bolstering the security of embedded systems. This research represents a significant advancement in safeguarding FPGA applications and other use cases from cyber threats, improving the overall performance and reliability of embedded systems and hardware security.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.453
Threshold uncertainty score0.300

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.006
GPT teacher head0.226
Teacher spread0.220 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicPhysical Unclonable Functions (PUFs) and Hardware SecurityFrench-language works237,207