Results 21 to 30 of about 11,140 (252)
Algebraic attacks using SAT-solvers
An algebraic attack on a cryptosystem consists of transforming the problem into the solution of a system of polynomial equations, usually over a finite field. The paper ``Algebraic attacks using SAT-solvers'' discusses different ways to efficiently transform the polynomial system into a logical clause.
Philipp Jovanovic, Martin Kreuzer
openaire +1 more source
A SAT Attack on Rota's Basis Conjecture.
The SAT modulo Symmetries (SMS) is a recently introduced framework for dynamic symmetry breaking in SAT instances. It combines a CDCL SAT solver with an external lexicographic minimality checking algorithm. We extend SMS from graphs to matroids and use it to progress on Rota’s Basis Conjecture (1989), which states that one can always decompose a ...
Markus Kirchweger +2 more
openaire +3 more sources
An attack on Zarankiewicz's problem through SAT solving
24 pages, 2 figures.
openaire +2 more sources
RAFA: Redundancies-assisted Algebraic Fault Analysis and its implementation on SPN block ciphers
Algebraic Fault Analysis (AFA) is a cryptanalysis for block ciphers proposed by Courtois et al., which incorporates algebraic cryptanalysis to overcome the complexity of manual analysis within the context of Differential Fault Analysis (DFA).
Zehong (Zephyr) Qiu, Fan Zhang
doaj +1 more source
Reevaluating Graph-Neural-Network-Based Runtime Prediction of SAT-Based Circuit Deobfuscation
Logic locking is a technique that can help hinder reverse-engineering-based attacks in the IC supply chain from untrusted foundries or end-users. In 2015, the Boolean Satisfiability (SAT) attack was introduced.
Guangwei Zhao, Kaveh Shamsi
doaj +1 more source
Peek into the Black-Box: Interpretable Neural Network using SAT Equations in Side-Channel Analysis
Deep neural networks (DNN) have become a significant threat to the security of cryptographic implementations with regards to side-channel analysis (SCA), as they automatically combine the leakages without any preprocessing needed, leading to a more ...
Trevor Yap +3 more
doaj +1 more source
On Cryptographic Attacks Using Backdoors for SAT
Propositional satisfiability (SAT) is at the nucleus of state-of-the-art approaches to a variety of computationally hard problems, one of which is cryptanalysis. Moreover, a number of practical applications of SAT can only be tackled efficiently by identifying and exploiting a subset of formula's variables called backdoor set (or simply
Alexander A. Semenov +4 more
openaire +2 more sources
Noise‐based logic locking scheme against signal probability skew analysis
Due to integrated circuit (IC) production chain globalisation, several new threats such as hardware trojans, counterfeiting and overproduction are threatening the IC industry. So logic locking is deployed to hinder these security threats.
Ahmad Rezaei, Ali Mahani
doaj +1 more source
SHA-256 Collision Attack with Programmatic SAT [PDF]
To appear in the 2024 Proceedings of the International Workshop on Satisfiability Checking and Symbolic ...
Nahiyan Alamgir +2 more
openaire +2 more sources
Deep Graph Learning for Circuit Deobfuscation
Circuit obfuscation is a recently proposed defense mechanism to protect the intellectual property (IP) of digital integrated circuits (ICs) from reverse engineering.
Zhiqian Chen +8 more
doaj +1 more source

