Results 11 to 20 of about 29,768,854 (286)
Finding Collisions in the Full SHA-1 [PDF]
, 2005 In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than 269 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound.
Xiaoyun Wang 0001 +2 more
openaire +4 more sources
Modified SHA-1 Algorithm [PDF]
Indonesian Journal of Electrical Engineering and Computer Science, 2018 Hashes are used to check the integrity of data. This paper modified SHA-1 by incorporating mixing method in every round for better diffusion. The modification increased the hash output to 192-bits. Increasing the output increases the strength because breaking the hash takes longer.
Rogel L. Quilala +2 more
openaire +4 more sources
Algebraic Cryptanalysis of 58-Round SHA-1 [PDF]
, 2007 In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article is to sophisticate and improve Wang’s attack by using algebraic techniques. We introduce new notions, namely semi-neutral bit and adjuster and propose then an improved message modification technique based on algebraic techniques.
Sugita, Makoto +3 more
openaire +3 more sources
Collisions of SHA-0 and Reduced SHA-1 [PDF]
, 2005 In this paper we describe improvements to the techniques used to cryptanalyze SHA-0 and introduce the first results on SHA-1. The results include a generic multi-block technique that uses near-collisions in order to find collisions, and a four-block collision of SHA-0 found using this technique with complexity 251.
Eli Biham +5 more
openaire +2 more sources
SHA-1 is a Shambles - First Chosen-Prefix Collision on SHA-1 and Application to the PGP Web of Trust. [PDF]
IACR Cryptol. ePrint Arch., 2020 The SHA-1 hash function was designed in 1995 and has been widely used during two decades. A theoretical collision attack was first proposed in 2004 [29], but due to its high complexity it was only implemented in practice in 2017, using a large GPU cluster [23].
Leurent, Gaëtan, Peyrin, Thomas
core +6 more sources
Second-Preimage Analysis of Reduced SHA-1 [PDF]
, 2010 Many applications using cryptographic hash functions do not require collision resistance, but some kind of preimage resistance. That's also the reason why the widely used SHA-1 continues to be recommended in all applications except digital signatures after 2010.
Christian Rechberger +1 more
openaire +4 more sources
Search framework for neutral bits and boomerangs in SHA‐1 collision attacks
IET Information Security, 2023 Neutral bits and boomerangs are key techniques for accelerating collision search in SHA‐1 attacks. The current acceleration techniques for SHA‐1 near‐collision attacks are reviewed and a generic search framework for neutral bits and boomerangs is ...
Degang Li, Yang Yang, Guang Zeng
doaj +1 more source
Gels, 2021 Salicylhydroxamic acid (SHA) is used as antimicrobic medicine and its concentration has to be monitored in urine. For the first time, silica xerogels doped with iron(III) have been proposed as sensor materials for SHA determination in biological samples.
Maria A. Morosanova +2 more
doaj +1 more source
SHA-1 and MD5 Cryptographic Hash Functions: Security Overview
Communications, 2015 Despite their obsolescence and recommendations they are phased out from production environment, MD5 and SHA-1 cryptographic hash functions remain defaults frequently offered in many applications, e.g., database managers.
Roman Jasek
doaj +1 more source
GigaByte: Publishing at the Speed of Research
GigaByte, 2020 Current practices in scientific publishing are unsuitable for rapidly changing fields and for presenting updatable data sets and software tools.
Scott C. Edmunds , Laurie Goodman
doaj +1 more source