GLLaMoR: Graph-based Logic Locking by Large Language Models for Enhanced Robustness

  • Akashdeep Saha
  • , Prithwish Basu Roy
  • , Johann Knechtel
  • , Ramesh Karri
  • , Ozgur Sinanoglu
  • , Lilas Alrahis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Logic locking protects integrated circuits (ICs) from design piracy. The idea is to insert key-controlled components, a.k.a. key-gates, to lock the IC's functionality, where the correct key is the designer's secret. The robustness of logic locking can be enhanced by carefully identifying best locations to insert key-gates, e.g., by analyzing the IC's topology and lock parts with high impact on functional behaviour. Traditionally, the challenge of identifying critical locations relies on computationally-intensive graph traversal and design methods like fault analysis. The rise of large language models (LLMs), which have recently demonstrated proficiency also on complex graph data, presents an interesting opportunity to revisit this challenge. Here, we present GLLaMoR, a first-of-its-kind framework using LLMs on graph-based IC representations to identify critical locking locations. Through LLM performance evaluation and end-to-end case studies, we demonstrate that GLLaMoR paves the way for more effective and scalable logic locking.

Original languageBritish English
Title of host publicationProceedings - 2025 IEEE 43rd VLSI Test Symposium, VTS 2025
PublisherIEEE Computer Society
ISBN (Electronic)9798331521448
DOIs
StatePublished - 2025
Event43rd IEEE VLSI Test Symposium, VTS 2025 - Tempe, United States
Duration: 28 Apr 202530 Apr 2025

Publication series

NameProceedings of the IEEE VLSI Test Symposium
ISSN (Electronic)2375-1053

Conference

Conference43rd IEEE VLSI Test Symposium, VTS 2025
Country/TerritoryUnited States
CityTempe
Period28/04/2530/04/25

Fingerprint

Dive into the research topics of 'GLLaMoR: Graph-based Logic Locking by Large Language Models for Enhanced Robustness'. Together they form a unique fingerprint.

Cite this