DyLock: A Dynamic Key-based SAT and Structural Attacks Resilient Low-overhead Logic Locking

Recent advances in secure integrated circuit design with logic locking have identified structural and algorithmic vulnerabilities that compromise various defenses to retrieve the correct secret key. Most defense techniques use static keys and incur a relatively high design overhead. This paper presents a novel dynamic key-based logic locking technique (DyLock) to improve resilience against Boolean satisfiability (SAT) and structural attacks while maintaining low design overhead. DyLock employs a nonlinear substitution-based key generator and counter-based architecture to produce a dynamic key sequence from static key bits. It significantly increases the SAT solver’s key search space and presents low key prediction accuracy for SWEEP and SCOPE attacks. An experimental evaluation using the ISCAS’85, ISCAS’89, and ITC’99 benchmark with 16/32/64-bit keys, DyLock demonstrates reduced area and power overheads compared to existing attack-resistant locking schemes. The proposed technique offers a balance between overhead and security, strengthening the locking against algorithmic and structural attacks.

Authors

Institutions

Publication Details

Published
2025-05-25
DOI
https://doi.org/10.1109/iscas56072.2025.11043665
Primary Topic
Physical Unclonable Functions (PUFs) and Hardware Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DyLock: A Dynamic Key-based SAT and Structural Attacks Resilient Low-overhead Logic Locking

Diksha Shekhawat, Jaya Dofe, Jai Gopal Pandey, Jugal Gandhi
Physical Unclonable Functions (PUFs) and Hardware Security
article

DyLock: A Dynamic Key-based SAT and Structural Attacks Resilient Low-overhead Logic Locking

Diksha Shekhawat, Jaya Dofe, Jai Gopal Pandey, Jugal Gandhi
article en

Abstract

Recent advances in secure integrated circuit design with logic locking have identified structural and algorithmic vulnerabilities that compromise various defenses to retrieve the correct secret key. Most defense techniques use static keys and incur a relatively high design overhead. This paper presents a novel dynamic key-based logic locking technique (DyLock) to improve resilience against Boolean satisfiability (SAT) and structural attacks while maintaining low design overhead. DyLock employs a nonlinear substitution-based key generator and counter-based architecture to produce a dynamic key sequence from static key bits. It significantly increases the SAT solver’s key search space and presents low key prediction accuracy for SWEEP and SCOPE attacks. An experimental evaluation using the ISCAS’85, ISCAS’89, and ITC’99 benchmark with 16/32/64-bit keys, DyLock demonstrates reduced area and power overheads compared to existing attack-resistant locking schemes. The proposed technique offers a balance between overhead and security, strengthening the locking against algorithmic and structural attacks.

California State University, Fullerton (US), Central Electronics Engineering Research Institute (IN)
Climate action
Openalex Percentile: Top 85%
Physical Unclonable Functions (PUFs) and Hardware Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

DyLock: A Dynamic Key-based SAT and Structural Attacks Resilient Low-overhead Logic Locking — Diksha Shekhawat, Jaya Dofe, et al. · (2025) | TGRS Research Map | TGRS