Add to ORKGAbstract. The Hash function Skein is one of the 5 finalists of NIST SHA-3 competition. It is designed based on the threefish block cipher and it only uses three primitive operations: modular addition, rotation and bitwise XOR (ARX). In this paper, we combine two short differential paths to a long differential path using the modular differential technique. And we present the semi-free start near-collision attack up to the 32-step Skein-256 with the Hamming weight 51. The complexity of our attack is about 2105
Abstract. In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...
Abstract. In this note, an observation is made regarding the Skein hash function [1] which has been ...
The SHA-3 competition organized by NIST aims to find a new hash standard as a replacement of SHA-2. ...
The hash function Skein is the submission of Ferguson et al. to the NIST Hash Competition, and is ar...
Skein is a new family of cryptographic hash functions. Its design combines speed, security, simplic-...
In this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected ...
The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. Nati...
International audienceThe hash function Skein is one of the five finalists of the NIST SHA-3 competi...
The Keccak hash function is the winner of the SHA-3 competition (2008–2012) and became the SHA-3 sta...
The main contributions of this paper are two-fold. Firstly, we present a novel direction in the ...
Abstract. The design principle of Merkle-Damg˚ard construction is collision resistance of the compre...
In this paper, we present a collision attack on the SHA-3 submission SHAMATA. SHAMATA is a stream ci...
Abstract. This paper presents improved collision attacks on round-reduced variants of the hash funct...
In 2007, the US National Institute for Standards and Technology (NIST) announced a call for the desi...
Abstract. In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...
Abstract. In this note, an observation is made regarding the Skein hash function [1] which has been ...
The SHA-3 competition organized by NIST aims to find a new hash standard as a replacement of SHA-2. ...
The hash function Skein is the submission of Ferguson et al. to the NIST Hash Competition, and is ar...
Skein is a new family of cryptographic hash functions. Its design combines speed, security, simplic-...
In this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected ...
The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. Nati...
International audienceThe hash function Skein is one of the five finalists of the NIST SHA-3 competi...
The Keccak hash function is the winner of the SHA-3 competition (2008–2012) and became the SHA-3 sta...
The main contributions of this paper are two-fold. Firstly, we present a novel direction in the ...
Abstract. The design principle of Merkle-Damg˚ard construction is collision resistance of the compre...
In this paper, we present a collision attack on the SHA-3 submission SHAMATA. SHAMATA is a stream ci...
Abstract. This paper presents improved collision attacks on round-reduced variants of the hash funct...
In 2007, the US National Institute for Standards and Technology (NIST) announced a call for the desi...
Abstract. In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...
Abstract. In this note, an observation is made regarding the Skein hash function [1] which has been ...