Results 171 to 180 of about 2,808 (186)
Some of the next articles are maybe not open access.
Cryptanalysis of 1-Round KECCAK
2018In 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 +2 more
openaire +1 more source
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 +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 +1 more source
Securing MANETs Using SHA3 Keccak Algorithm
2019As the world is going wireless, security is the primary concern. MANETs due to their dynamic nature are prone to major security risks. In few scenarios the nodes in a MANET either intentionally or unintentionally behave as selfish or malicious nodes. So identification and isolation of such nodes is necessary.
P. Ramya, T. SairamVamsi
openaire +1 more source
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 +1 more source
MILP-aided cube-attack-like cryptanalysis on Keccak Keyed modes
Designs, Codes and Cryptography, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wenquan Bi +4 more
openaire +1 more source
Cryptanalysis of 2 Round Keccak-384
2018In 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 +2 more
openaire +1 more source
FPGA-based Design Approaches of Keccak Hash Function
2012 15th Euromicro Conference on Digital System Design, 2012Keccak hash function has been submitted to SHA-3 competition and it belongs to the final five candidate functions. In this paper FPGA implementations of Keccak function are presented. The designs were coded using HDL language and for the hardware implementation, a XILINX Virtex-5 FPGA was used.
George Provelengios +3 more
openaire +1 more source
Embedded Keccak implementation on FPGA
2022 IEEE International Conference on Design & Test of Integrated Micro & Nano-Systems (DTS), 2022Jalel Ktari +4 more
openaire +1 more source
New Collision Attacks on Round-Reduced Keccak
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
Kexin Qiao +3 more
openaire +1 more source