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

Authors

220

  1. HH
    Houman Homayoun

    George Mason University, United States

    13 publications · 494 citations

    12

    h-index

  2. OS
    Ozgur Sinanoglu

    New York University, United States

    11 publications · 1.1K citations

    11

    h-index

  3. AS
    Avesta Sasan

    George Mason University, United States

    12 publications · 478 citations

    11

    h-index

  4. YJ
    Yier Jin

    University of Central Florida, United States

    10 publications · 933 citations

    10

    h-index

  5. DZ
    David Z. Pan

    The University of Texas at Austin, United States

    10 publications · 933 citations

    10

    h-index

1–5 of 220

Venues

  1. 11

    h-index

  2. 6

    h-index

  3. ACM Transactions on Design Automation of Electronic Systems

    TODAES · 3 publications · 61 citations

    3

    h-index

  4. IACR Cryptology ePrint Archive

    Repository · 3 publications · 40 citations

    3

    h-index

  5. 3

    h-index

1–5