Results 141 to 150 of about 1,059 (176)

Algebraic properties of the maps χ n. [PDF]

Des Codes Cryptogr
Schoone J, Daemen J.
europepmc   +1 more source

Secure and scalable dual blockchain and IPFS driven IoT ecosystem for next gen healthcare systems. [PDF]

Sci Rep
Mallick SR, Lenka RK, Sobhanayak S.
europepmc   +1 more source

New Attacks on Keccak-224 and Keccak-256 [PDF]

Lecture Notes in Computer Science, 2012
The Keccak hash function is one of the five finalists in NIST's SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: After several years of cryptanalysis and a lot of effort, the largest number of Keccak rounds for which actual collisions were found was only 2.
Orr Dunkelman, Adi Shamir, Itai Dinur
exaly   +7 more sources

Rotational Cryptanalysis of Round-Reduced Keccak [PDF]

Lecture Notes in Computer Science, 2014
In this paper we attack round-reduced Keccak hash function with a technique called rotational cryptanalysis. We focus on Keccak variants proposed as SHA-3 candidates in the NIST’s contest for a new standard of cryptographic hash function. Our main result is a preimage attack on 4-round Keccak and a 5-round distinguisher on Keccak-\(f\)[1600 ...
Josef Pieprzyk, Marian Srebrny
exaly   +8 more sources

Cryptanalysis of 2 Round Keccak-384 [PDF]

Lecture Notes in Computer Science, 2018
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 \(2^{129}\). In our analysis, we find a preimage in the time complexity of \(2^{89}\) and almost same memory is required.
Rajendra Kumar
exaly   +6 more sources

Differential Propagation Analysis of Keccak [PDF]

Lecture Notes in Computer Science, 2012
In this paper we introduce new concepts that help read and understand low-weight differential trails in Keccak. We then propose efficient techniques to exhaustively generate all 3-round trails in its largest permutation below a given weight. This allows us to prove that any 6-round differential trail in Keccak-f[1600] has weight at least 74.
Gilles van Assche, Gilles Van Assche
exaly   +6 more sources

Unaligned Rebound Attack: Application to Keccak [PDF]

Lecture Notes in Computer Science, 2012
We analyze the internal permutations of Keccak, one of the NIST SHA-3 competition finalists, in regard to differential properties. By carefully studying the elements composing those permutations, we are able to derive most of the best known differential paths for up to 5 rounds. We use these differential paths in a rebound attack setting and adapt this
Jian Guo, Thomas Peyrin
exaly   +7 more sources

Some of the next articles are maybe not open access.

Related searches:

Algebraic Attacks on Round-Reduced Keccak

Lecture Notes in Computer Science, 2021
Since Keccak was selected as the SHA-3 standard, both its hash mode and keyed mode have attracted lots of third-party cryptanalysis. Especially in recent years, there is progress in analyzing the collision resistance and preimage resistance of round-reduced Keccak.
Takanori Isobe, Fukang Liu
exaly   +2 more sources

Practical Analysis of Reduced-Round Keccak

Lecture Notes in Computer Science, 2011
Keccak is a finalist of the SHA-3 competition. In this paper we propose a practical distinguisher on 4 rounds of the hash function with the submission parameters. Recently, the designers of Keccak published several challenges on reduced versions of the hash function. With regard to this, we propose a preimage attack on 2 rounds, a collision attack on 2
Willi Meier
exaly   +2 more sources

Conditional Cube Attack on Reduced-Round Keccak Sponge Function [PDF]

Lecture Notes in Computer Science, 2017
The security analysis of Keccak, the winner of SHA-3, has attracted considerable interest. Recently, some attention has been paid to the analysis of keyed modes of Keccak sponge function.
Xiaoyun Wang
exaly   +2 more sources