Practical Distinguishers against 6-Round Keccak-f Exploiting Self-Symmetry

Kuila, Sukhendu; Saha, Dhiman; Pal, Madhumangal; Chowdhury, Debashish

doi:10.1007/978-3-319-06734-6_6

Cited by 7 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this regard, it is to be noted that reduced version of K eccak has been attacked through rotational cryptanalysis [25,26]. The very low Hamming weight of employed round constants on Keccak has been utilized to mount the attack.…”

Section: Rotational Cryptanalysismentioning

confidence: 99%

CASH: Cellular Automata Based Parameterized Hash

Kuila

Saha²,

Pal

et al. 2014

Security, Privacy, and Applied Cryptography Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. In this paper, we propose a new Cellular Automata (CA) based scalable parameterized hash function family named CASH. The construction of CASH is inspired by sponge function and the internal round transformation employs linear CA. For the first time, we have managed to merge the classical add-round-constant and subsequent diffusion layers. The primitive function of CASH family is proved to be secure against the state-of-the-art attacks. All the designs are implemented on Xilinx Virtex-6 FPGAs and compared with the best reported results in literature. The results show that CASH outperforms the SHA-3 finalists with respect to throughput and throughput/area.

show abstract

Section: Rotational Cryptanalysismentioning

confidence: 99%

CASH: Cellular Automata Based Parameterized Hash

Kuila

Saha²,

Pal

et al. 2014

Security, Privacy, and Applied Cryptography Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…The standard characteristic that we use relies on the already-known concept of parity kernels, which allows to minimize the number of S-Boxes in two consecutive rounds of Keccak-f . This notion has been described in the submission document [3], and has been used in cryptanalytic results [12,22,31]. The behavior is possible due to two observations: first, a state-difference may be invariant of the θ step if there is an even number of active bits in each of the 320 column of the internal state; and second, an active S-Box in χ (or in χ −1 ) leaves unchanged a 1-bit difference with probability 2 −2 .…”

Section: Standard Differential Characteristicsmentioning

confidence: 99%

“…So far, the best attacks on the hash function in the standard model reach five rounds [14,15], while in the keyed model reach up to nine rounds [16]. For the underlying permutation, the best analysis in terms of complexity reaches six rounds and requires 2 11 queries [22], while in terms of number of rounds, the best is eight and requires 2 491 queries [17].…”

Section: Introductionmentioning

confidence: 99%

Internal Differential Boomerangs: Practical Analysis of the Round-Reduced Keccak- $$f$$ f Permutation

Jean

Nikolić

2015

Fast Software Encryption

View full text Add to dashboard Cite

We introduce internal differential boomerang distinguisher as a combination of internal differentials and classical boomerang distinguishers. The new boomerangs can be successful against cryptographic primitives having high-probability round-reduced internal differential characteristics. The internal differential technique, which follow the evolution of differences between parts of the state, is particularly meaningful for highly symmetric functions like the inner permutation Keccak-f of the hash functions defined in the future SHA-3 standard. We find internal differential and standard characteristics for three to four rounds of Keccak-f , and with the use of the new technique, enhanced with a strong message modification, show practical distinguishers for this permutation. Namely, we need 2 12 queries to distinguish 7 rounds of the permutation starting from the first round, and approximately 2 18 queries to distinguish 8 rounds starting from the fourth round. Due to the exceptionally low complexities, all of our results have been completely verified with a computer implementation of the analysis.

show abstract

“…While the main findings over Keccak concentrated on pre-images and collisions, Keccak-f received considerable attention from what is known as distinguishing attacks. These attacks, which aim at exhibiting non-random behavior by targeting the hermetic sponge strategy [BDPA07], employ various techniques like constrained-input contrained-output (CICO) [AK09], rotational symmetry [MPS12], self-symmetry [KSPC14], ZeroSum [AM09], [DL12,BC10a,BC10b], rebound [DGPW12], cube-tester [DMP + 14] and recently reported internal differential boomerang [JN15]. However, among these, only the ZeroSum distinguisher is able to distinguish all 24-rounds of Keccak-f .…”

Section: Introductionmentioning

confidence: 99%

SymSum: Symmetric-Sum Distinguishers Against Round Reduced SHA3

Saha

Kuila

Chowdhury

2017

ToSC

Self Cite

View full text Add to dashboard Cite

In this work we show the existence of special sets of inputs for which the sum of the images under SHA3 exhibits a symmetric property. We develop an analytical framework which accounts for the existence of these sets. The framework constitutes identification of a generic property of iterated SPN based functions pertaining to the round-constant addition and combining it with the notion of m−fold vectorial derivatives for differentiation over specially selected subspaces. Based on this we propose a new distinguisher called SymSum for the SHA3 family which penetrates up to 9 rounds and outperforms the ZeroSum distinguisher by a factor of four. Interestingly, the current work is the first analysis of SHA3/Keccak that relies on round-constants but is independent of their Hamming-weights.

show abstract

Practical Distinguishers against 6-Round Keccak-f Exploiting Self-Symmetry

Cited by 7 publications

References 7 publications

CASH: Cellular Automata Based Parameterized Hash

CASH: Cellular Automata Based Parameterized Hash

Internal Differential Boomerangs: Practical Analysis of the Round-Reduced Keccak- $$f$$ f Permutation

SymSum: Symmetric-Sum Distinguishers Against Round Reduced SHA3

Contact Info

Product

Resources

About