Results 11 to 20 of about 400,569 (282)
A Novel Probability-Based Logic-Locking Technique: ProbLock
Sensors, 2021 Integrated circuit (IC) piracy and overproduction are serious issues that threaten the security and integrity of a system. Logic locking is a type of hardware obfuscation technique where additional key gates are inserted into the circuit.
Michael Yue, Sara Tehranipoor
doaj +1 more source
On Preventing SAT Attack with Decoy Key-Inputs [PDF]
2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 2021 The globalized supply chain in the semiconductor industry raises several security concerns such as IC overproduction, intellectual property piracy and design tampering. Logic locking has emerged as a Design-for-Trust countermeasure to address these issues.
Nguyen, Quang-Linh +3 more
openaire +1 more source
A preimage attack on reduced GIMLI‐HASH with unbalanced squeezing phase
IET Information Security, 2023 In Conference on Cryptographic Hardware and Embedded System 2017, Bernstein et al. proposed GIMLI, a 384‐bit permutation with 24 rounds, which aims to provide high performance on various platforms.
Yongseong Lee +3 more
doaj +1 more source
Algebraic Fault Attack Against SIMECK Cipher Based on Optimized Fault Location [PDF]
Jisuanji gongcheng, 2019 This paper proposes a algebraic fault attack method based on optimized fault location against SIMECK cipher.By analyzing encryption diffusion defect of the SIMECK round function and the failure cause,the deterministic propagation characteristics of ...
HUANG Changyang, WANG Tao, WANG Xiaohan, CHEN Qingchao, YIN Shizhuang
doaj +1 more source
Linear Cryptanalyses of Three AEADs with GIFT-128 as Underlying Primitives
IACR Transactions on Symmetric Cryptology, 2021 This paper considers the linear cryptanalyses of Authenticated Encryptions with Associated Data (AEADs) GIFT-COFB, SUNDAE-GIFT, and HyENA. All of these proposals take GIFT-128 as underlying primitives. The automatic search with the Boolean satisfiability
Ling Sun, Wei Wang, Meiqin Wang
doaj +1 more source
Algebraic attacks using SAT-solvers
Groups – Complexity – Cryptology, 2010 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.
Jovanovic, Philipp, Kreuzer, Martin
openaire +1 more source
CAS-Lock: A Security-Corruptibility Trade-off Resilient Logic Locking Scheme
Transactions on Cryptographic Hardware and Embedded Systems, 2019 Logic locking has recently been proposed as a solution for protecting gatelevel semiconductor intellectual property (IP). However, numerous attacks have been mounted on this technique, which either compromise the locking key or restore the original ...
Bicky Shakya +3 more
doaj +1 more source
Finding Collisions against 4-Round SHA-3-384 in Practical Time
IACR Transactions on Symmetric Cryptology, 2022 The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. National Institute of Standards and Technology (NIST) in 2012 as the next generation of Secure Hash Algorithm (SHA-3).
Senyang Huang +3 more
doaj +1 more source
A SAT Attack on the Erdős Discrepancy Conjecture [PDF]
, 2014 8 pages.
Konev, Boris, Lisitsa, Alexei
openaire +2 more sources
RAFA: Redundancies-assisted Algebraic Fault Analysis and its implementation on SPN block ciphers
Transactions on Cryptographic Hardware and Embedded Systems, 2023 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