Results 241 to 250 of about 400,569 (282)

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

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 Partial Attack on Compound Logic Locking

2020 Asian Hardware Oriented Security and Trust Symposium (AsianHOST), 2020
Logic locking (LL) is used to protect designs from various security vulnerabilities in the Integrated Circuits (IC) supply chain. Development of a satisfiability checking (SAT) attack in 2015, which breaks all the existing LL techniques at that time, divides the LL defenses into two classes: pre-SAT and post-SAT.
Melbin John, Aadil Hoda, Ramanuj Chouksey, Chandan Karfa   +3 more
openaire   +1 more source

An Efficient SAT-Attack Algorithm Against Logic Encryption

2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design (IOLTS), 2019
This paper presents a novel efficient SAT-attack algorithm for logic encryption. The existing SAT-attack algorithm can decrypt almost all encrypted circuits proposed so far, however, there are cases that it takes a huge amount of CPU time. This is because the number of clauses being added during the decryption increases drastically in that case.
Yusuke Matsunaga, Masayoshi Yoshimura
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   +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, Hai Zhou
openaire   +1 more source

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

Algebraic Cryptanalysis of SMS4: Gröbner Basis Attack and SAT Attack Compared

2010
The SMS4 block cipher is part of the Chinese WAPI wireless standard. This paper describes the specification and offers a specification for a toy version called simplified SMS4 (S-SMS4). We explore algebraic attacks on SMS4 and S-SMS4 using Grobner basis attacks on equation systems over GF(2) and GF(28), as well as attacks using a SAT solver derived ...
Jeremy Erickson, Jintai Ding, Chris Christensen   +2 more
openaire   +1 more source

The SAT Attack on IC Camouflaging: Impact and Potential Countermeasures

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2020
Integrated circuit (IC) camouflaging is a promising defense against so-called IC extraction attacks that seek to reverse engineer the netlist of a packaged IC using delayering and imaging techniques. Camouflaging works by hiding the Boolean functionality of selected gates in the netlist from reverse engineering, albeit at the cost of increased gate ...
Mohamed El Massad, Siddharth Garg, Mahesh V. Tripunitara   +2 more
openaire   +1 more source

Tree-Based Logic Encryption for Resisting SAT Attack

2017 IEEE 26th Asian Test Symposium (ATS), 2017
Logic encryption is an IC protection technique which inserts key gates or logic blocks controlled by key inputs to hide a circuit's functionality. An encrypted circuit needs to be activated with a secret key for being functional. Recently, a powerful attack method based on SAT solving was proposed.
openaire   +1 more source