Results 151 to 160 of about 1,059 (176)
Some of the next articles are maybe not open access.
Side-Channel Analysis of MAC-Keccak
2013 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), 2013NIST 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
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 +2 more
openaire +2 more sources
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 +2 more
openaire +2 more sources
Differential Cryptanalysis of Keccak Variants
2013In 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 +3 more
openaire +2 more sources
New Collision Attacks on Round-Reduced Keccak
Lecture Notes in Computer Science, 2017In 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
Jian Guo, Meicheng Liu, Ling Song
exaly +4 more sources
Improved Practical Attacks on Round-Reduced Keccak
Journal of Cryptology, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Itai Dinur, Orr Dunkelman, Adi Shamir
openaire +3 more sources
Differential Biases in Reduced-Round Keccak
2014The 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 +2 more sources
GPU Implementation of the Keccak Hash Function Family
2011Hash 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 +2 more
openaire +1 more source
FPGA implementation of new standard hash function Keccak
2014 IEEE 3rd Global Conference on Consumer Electronics (GCCE), 2014High-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 +2 more
openaire +2 more sources
Shuffle and Mix: On the Diffusion of Randomness in Threshold Implementations of Keccak
2019Threshold Implementations are well known as a provably first-order secure Boolean masking scheme even in the presence of glitches. A precondition for their security proof is a uniform input distribution at each round function, which may require an injection of fresh randomness or an increase in the number of shares.
Felix Wegener +2 more
openaire +3 more sources
Skup kriptografskih algoritama grupe Keccak [PDF]
U završnom radu su opisani algoritmi uključeni u slobodno dostupni programski paket EXtended Keccak Code Package (XKCP). Izrađena je i objašnjena programska implementacija za ispitivanje i prikaz rada algoritama za računanje sažetaka sadržanih u normama FIPS 202 i NIST SP 800-185 koje je ostvarila grupa Keccak.
openaire +1 more source

