Results 221 to 230 of about 11,140 (252)

Modeling SAT-Attack Search Complexity

2020 IEEE International Symposium on Circuits and Systems (ISCAS), 2020
In this paper, a metric based on mathematical modeling is proposed to evaluate the strength in security of a logic-locked circuit against a satisfiability (SAT) based attack. Current approaches estimate the SAT resilience experimentally based on time-to-solve or the number of calls to a SAT-solver.
Saran Phatharodom, Nagarajan Kandasamy, Ioannis Savidis   +2 more
openaire   +1 more source

SARLock: SAT attack resistant logic locking

2016 IEEE International Symposium on Hardware Oriented Security and Trust (HOST), 2016
Logic locking is an Intellectual Property (IP) protection technique that thwarts IP piracy, hardware Trojans, reverse engineering, and IC overproduction. Researchers have taken multiple attempts in breaking logic locking techniques and recovering its secret key. A Boolean Satisfiability (SAT) based attack has been recently presented that breaks all the
Muhammad Yasin, Bodhisatwa Mazumdar, Jeyavijayan (JV) Rajendran, Ozgur Sinanoglu   +3 more
openaire   +1 more source

The SAT Attack

2019
This chapter elaborates on the SAT attack, which breaks all pre-SAT logic locking techniques. The SAT attack is an oracle-guided attack that utilizes a SAT solver to compute attack patterns that refine the key search space iteratively. The SAT attack has changed the direction of logic locking research; developing efficient countermeasures against the ...
Muhammad Yasin, Jeyavijayan Rajendran, Ozgur Sinanoglu   +2 more
openaire   +1 more source

SAT-attack Resilience Measure for Access Restricted Circuits

Proceedings of the 2021 Great Lakes Symposium on VLSI, 2021
With the recent introduction of techniques to restrict scan chain access, a new class of deobfuscation problems emerge, in which the threat model, although similar to deobfuscation of a logic locked circuit, forms a novel class of attack. In this paper, the concept of a logic restricted circuit is generalized and defined.
Saran Phatharodom, Avesta Sasan, Ioannis Savidis   +2 more
openaire   +1 more source

Attacking Bivium Using SAT Solvers

2008
In this paper we present experimental results of an application of SAT solvers in current cryptography. Trivium is a very promising stream cipher candidate in the final phase of the eSTREAM project. We use the fastest industrial SAT solvers to attack a reduced version of Trivium - called Bivium.
Tobias Eibach, Enrico Pilz, Gunnar Völkel   +2 more
openaire   +1 more source

SAT-based bit-flipping attack on logic encryptions

2018 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2018
Logic encryption is a hardware security technique that uses extra key inputs to prevent unauthorized use of a circuit. With the discovery of the SAT-based attack, new encryption techniques such as SARLock and Anti-SAT are proposed, and further combined with traditional logic encryption techniques, to guarantee both high error rates and resilience to ...
Yuanqi Shen, Amin Rezaei 0001, Hai Zhou 0001   +2 more
openaire   +2 more sources

Enhancements to SAT Attack

ACM Transactions on Design Automation of Electronic Systems, 2018
Logic encryption is an IC protection technique for preventing an IC design from overproduction and unauthorized use. It hides a design’s functionality by inserting key gates and key inputs, such that a secret key is required to activate the design and make it functioncorrectly.
openaire   +1 more source

A SAT Attack on Higher Dimensional Erdős–Szekeres Numbers

2021
A famous result by Erdős and Szekeres (1935) asserts that, for all $k,d \in \mathbb{N}$, there is a smallest integer $n = g^{(d)}(k)$ such that every set of at least $n$ points in $\mathbb{R}^d$ in general position contains a $k$-gon, that is, a subset of $k$ points which is in convex position.
openaire   +2 more sources

Strategies on Algebraic Attacks Using SAT Solvers

2008 The 9th International Conference for Young Computer Scientists, 2008
SAT solvers are employed in algebraic attacks to stream ciphers in recent years. This attack describes a cipher by a Boolean equation system in the initial state, and then converts the equation system into a SAT instance. After that, attackers use SAT solvers to solve the instance, and thus recover the initial state.
openaire   +1 more source

On SAT-Based Attacks On Encrypted Sequential Logic Circuits

20th International Symposium on Quality Electronic Design (ISQED), 2019
Logic encryption has emerged as a solution to the hardware intellectual property (IP) protection prob-lem. In recent years, many attack methods have been proposed to counter the protection offered by logic encryption. Most state-of-the-art logic encryption schemes have been shown to be susceptible to one or more of these attack methods.
Yasaswy Kasarabada, Suyuan Chen, Ranga Vemuri   +2 more
openaire   +1 more source