Sat Attacks
SAT Attacks is a class of cryptographic attack that exploits Boolean satisfiability solving to systematically discover the correct key inputs of a logic-locked circuit by iteratively analyzing input-output correspondences under miter-based constraint formulations.
116
Publications
6.4K
Citations
220
Authors
79
Institutions
Publications per year
2017–2026
100
Variants
Boolean Satisfiability Attacks
Parents
116
Evaluating the security of logic encryption algorithms
Pramod Subramanyan, Sayak Ray, Sharad Malik · 2015 · 772 citations
SARLock: SAT attack resistant logic locking
Muhammad Yasin, Bodhisatwa Mazumdar, Jeyavijayan Rajendran et al. · 2016 · 402 citations
AppSAT: Approximately deobfuscating integrated circuits
Kaveh Shamsi, Meng Li, Travis Meade et al. · 2017 · 323 citations · Full text
1–5 of 116
220
12
h-index
11
h-index
11
h-index
10
h-index
10
h-index
1–5 of 220
79
University of Florida
Gainesville, United States
14 h-index
48 publications
2K citations
New York University
New York, United States
14 h-index
34 publications
2.2K citations
George Mason University
Fairfax, United States
12 h-index
43 publications
1.9K citations
The University of Texas at Austin
Austin, United States
10 h-index
24 publications
2.5K citations

University of Central Florida
Orlando, United States
7 h-index
16 publications
2K citations
The University of Texas at Dallas
Richardson, United States
7 h-index
16 publications
1.3K citations
University of California, Davis
Davis, United States
5 h-index
10 publications
189 citations
New York University Abu Dhabi
Abu Dhabi, United Arab Emirates
5 h-index
7 publications
573 citations
1–8 of 79
11 publications · 522 citations
11
h-index
6 publications · 282 citations
6
h-index
TODAES · 3 publications · 61 citations
3
h-index
Repository · 3 publications · 40 citations
3
h-index
3 publications · 68 citations
3
h-index
1–5