Results 141 to 150 of about 1,005 (175)

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

A privacy-preserving cloud storage framework with hybrid encryption, homomorphic keyword search, and blockchain-based integrity verification. [PDF]

Sci Rep
Ahmed HMA, Zubair S, Tawfik M, Tawfik M.
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

Cryptanalysis of 1-Round KECCAK [PDF]

Lecture Notes in Computer Science, 2018
In this paper, we give the first pre-image attack against 1-round KECCAK-512 hash function, which works for all variants of 1-round KECCAK. The attack gives a preimage of length less than 1024 bits by solving a system of 384 linear equations. We also give a collision attack against 1-round KECCAK using similar analysis.
Rajendra Kumar
exaly   +5 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.
Joan Daemen, Gilles van Assche, Gilles Van Assche   +2 more
exaly   +6 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, Shashank Singh
exaly   +6 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.
Willi Meier, Takanori Isobe, Fukang Liu   +2 more
exaly   +2 more sources

Improved Practical Attacks on Round-Reduced Keccak

Journal of Cryptology, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Orr Dunkelman, Adi Shamir, Itai Dinur
exaly   +4 more sources

Side-Channel Analysis of MAC-Keccak

2013 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), 2013
NIST recently completed the SHA-3 competition with the selection of Keccak as the new standard for crypto-graphic hashing. In this paper, we present a comprehensive Side-Channel Analysis of Keccak, when it is used with a secret key to generate a Message Authentication Code (MAC) (MAC-Keccak). Our analysis covers all the variations of the algorithm.
Mostafa M. I. Taha, Patrick Schaumont
openaire   +2 more sources

Keccak und der SHA-2

Datenschutz und Datensicherheit - DuD, 2013
Wie beim DES-Nachfolger AES schrieb das US-amerikanische NIST 2007 einen offentlichen Wettbewerb um die Nachfolge des Hashverfahrens SHA-2 aus. Im Oktober 2012 fiel die Wahl auf Keccak. Die Autoren stellen den Hashalgorithmus vor, beschreiben eine Smartcard-Implementierung und stellen das Verfahren dem „amtierenden“ SHA-2-Standard gegenuber.
Pawel Swierczynski, Gregor Leander, Christof Paar   +2 more
openaire   +2 more sources