Results 131 to 140 of about 289 (167)

Cryptanalysis of 2 Round Keccak-384

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   +3 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   +3 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
Maria Naya-Plasencia, Meier Willi, Naya-Plasencia Maria   +2 more
exaly   +2 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   +1 more source

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   +1 more source

Differential Cryptanalysis of Keccak Variants

2013
In October 2012, NIST has announced Keccak as the winner of the SHA-3 cryptographic hash function competition. Recently, at CT-RSA 2013, NIST brought up the idea to standardize Keccak variants with different parameters than those submitted to the SHA-3 competition.
Stefan Kölbl, Florian Mendel, Tomislav Nad, Martin Schläffer   +3 more
openaire   +1 more source

Differential Biases in Reduced-Round Keccak

2014
The Keccak hash function is the winner of the SHA-3 competition. In this paper, we examine differential propagation properties of Keccak constituent functions. We discover that low-weight differentials produce a number of biased and fixed difference bits in the state after two rounds and provide a theoretical explanation for the existence of such a ...
Sourav Das, Willi Meier
openaire   +1 more source

GPU Implementation of the Keccak Hash Function Family

2011
Hash functions are one of the most important cryptographic primitives. Some of the currently employed hash functions like SHA-1 or MD5 are considered broken today. Therefore, in 2007 the US National Institute of Standards and Technology announced a competition for a new family of hash functions.
Pierre-Louis Cayrel, Gerhard Hoffmann, Michael Schneider 0002   +2 more
openaire   +1 more source

New Collision Attacks on Round-Reduced Keccak

2017
In this paper, we focus on collision attacks against Keccak hash function family and some of its variants. Following the framework developed by Dinur et al. at FSE 2012 where 4-round collisions were found by combining 3-round differential trails and 1-round connectors, we extend the connectors one round further hence achieve collision attacks for up to
Kexin Qiao, Ling Song 0001, Meicheng Liu, Jian Guo 0001   +3 more
openaire   +2 more sources

FPGA implementation of new standard hash function Keccak

2014 IEEE 3rd Global Conference on Consumer Electronics (GCCE), 2014
High-speed hardware for Keccak, which was selected as a new standard hash function named SHA-3, was developed and its performance was evaluated against SHA-1 and −2 circuits through the use of various FPGA platforms. The results showed that Keccak is suitable for high-speed hardware implementations, but it is getting harder to implement on new FPGA ...
Tatsuya Honda, Hendra Guntur, Akashi Satoh   +2 more
openaire   +1 more source