搜索结果: 1-15 共查到“密码学 Keccak”相关记录41条 . 查询时间(0.063 秒)
Cryptanalysis of Round-Reduced KECCAK using Non-Linear Structures
KECCAK SHA-3 Hash function
2019/8/2
In this paper, we present new preimage attacks on KECCAK-384 and KECCAK-512 for 2, 3 and 4 rounds. The attacks are based on non-linear structures (structures that contain quadratic terms). These struc...
Conditional cube attack on round-reduced \textsc{Keccak} keyed modes was proposed by Huang et al. at EUROCRYPT 2017. In their attack, a conditional cube variable was introduced, whose diffusion was si...
In this paper, we present a cryptanalysis of round reduced Keccak-384 for 2 rounds. The best known preimage attack for this variant of Keccak has the time complexity 21292129. In our analysis, we find...
Cube-Attack-Like Cryptanalysis of Round-Reduced Keccak Using MILP
Ketje Xoodoo Keccak-MAC
2018/11/19
Cube-attack-like cryptanalysis on round-reduced Keccak was proposed by Dinur et al. at EUROCRYPT 2015. It recovers the key through two phases: the preprocessing phase for precomputing a look-up table ...
Shuffle and Mix: On the Diffusion of Randomness in Threshold Implementations of Keccak
side-channel analysis threshold implementation uniformity
2018/11/13
Threshold Implementations are well-known as a provably firstorder secure Boolean masking scheme even in the presence of glitches. A precondition for their security proof is a uniform input distributio...
Finding Ordinary Cube Variables for Keccak-MAC with Greedy Algorithm
Keccak Keccak-MAC ordinary cube variables
2018/9/6
In this paper, we present an alternative method to choose ordinary cube variables for Keccak-MAC. Firstly, we choose some good candidates for ordinary cube variables with key-independent conditions. T...
Cube-attack-like cryptanalysis was proposed by Dinur et al. at EUROCRYPT 2015, which recovers the key of Keccak keyed modes in a divide-and-conquer manner. In their attack, one selects cube variables ...
New Insights into Divide-and-Conquer Attacks on the Round-Reduced Keccak-MAC
Keccak-MAC Divide-and-Conquer Attacks Cube Attacks
2018/1/17
Keccak is the final winner of SHA-3 competition and it can be used as message authentic codes as well. The basic and balanced divide-and-conquer attacks on Keccak-MAC were proposed by Dinur et al. at ...
Rhythmic Keccak: SCA Security and Low Latency in HW
Glitch non-completeness threshold implementation
2017/12/19
Glitches entail a great issue when securing a cryptographic implementation in hardware. Several masking schemes have been proposed in the literature that provide security even in the presence of glitc...
Cryptanalysis of 1-Round KECCAK
Cryptanalysis KECCAK SHA-3
2017/10/30
In this paper, we give a pre-image attack against 1-round KECCAK-512 hash function which also works for 1-round of all the variants of KECCAK.
New MILP Modeling: Improved Conditional Cube Attacks to Keccak-based Constructions
Keccak SHA-3 KMAC
2017/10/30
In this paper, we provide a new MILP modeling to find better/optimal choices of conditional cubes. These choices generally find new or improved attacks against the keyed constructions based on Keccak ...
Improved Conditional Cube Attacks on Keccak Keyed Modes with MILP Method
MILP Conditional Cube Attack Keccak Keyed Mode
2017/8/29
Conditional cube attack is an efficient key-recovery attack on Keccak keyed modes proposed by Huang et al. at EUROCRYPT 2017. By assigning bit conditions, the diffusion of a conditional cube variable ...
Non-Full Sbox Linearization: Applications to Collision Attacks on Round-Reduced Keccak
Keccak SHA-3 hash function
2017/6/8
The Keccak hash function is the winner of the SHA-3 competition and became the SHA-3 standard of NIST in 2015. In this paper, we focus on practical collision attacks against round-reduced Keccak hash ...
The efficient protection of security critical devices against side-channel analysis attacks is a fundamental need in the age of Internet of Things and ubiquitous computing. In this work, we introduce ...
New techniques for trail bounds and application to differential trails in Keccak
differential cryptanalysis trail weight bounds
2017/2/28
We present new techniques to efficiently scan the space of high-probability differential trails in bit-oriented ciphers. Differential trails consist in sequences of state patterns that we represent as...