Results 241 to 250 of about 29,768,854 (286)
Traditional &Kampo Medicine, Volume 13, Issue 3, December 2026.
Akiko Kikuchi +4 more
wiley +1 more source
We report on the experiments we performed in order to assess the security of SHA-1 against the attack by Chabaud and Joux [5]. We present some ideas for optimizations of the attack and some properties of the message expansion routine. Finally, we show that for a reduced version of SHA-1, with 53 rounds instead of 80, it is possible to find collisions ...
Vincent Rijmen, Elisabeth Oswald
core +5 more sources
Finding Good Differential Patterns for Attacks on SHA-1 [PDF]
In this paper we analyse properties of the message expansion algorithm of SHA-1 and describe a method of finding differential patterns that may be used to attack reduced versions of SHA-1. We show that the problem of finding optimal differential patterns for SHA-1 is equivalent to the problem of finding minimal weight codeword in a large linear code ...
Krystian Matusiewicz, Josef Pieprzyk
openaire +4 more sources
Analysis of SHA-1 in Encryption Mode
This paper analyses the cryptographic hash function SHA- 1 in encryption mode. A detailed analysis is given of the resistance of SHA-1 against the most powerful known attacks today. It is concluded that none of these attacks can be applied successfully in practice to SHA-1.
Helena Handschuh +2 more
openaire +3 more sources
Analyze SHA-1 in message schedule
Abstract Wang et al have found a family of collisions in MD5. They reported their method to find a collision efficiently in SHA, and also to find a collision in SHA-1 within 269 hash steps in February 2005. In fact, we can still discover the decay phenomenon with the application of a message schedule’s judgment proposed in this work when inspection how
Yi-Shiung Yeh +3 more
openaire +2 more sources
Rescheduling for Optimized SHA-1 Calculation
This paper proposes the rescheduling of the SHA-1 hash function operations on hardware implementations. The proposal is mapped on the Xilinx Virtex II Pro technology. The proposed rescheduling allows for a manipulation of the critical path in the SHA-1 function computation, facilitating the implementation of a more parallelized structure without an ...
Ricardo Chaves +3 more
openaire +2 more sources
Quantum Implementation of SHA-1 [PDF]
As quantum computing technology rapidly advances, threats to existing symmetric-key and public-key cryptosystems are becoming increasingly real. In this study, we implement a SHA-1 quantum circuit that operates efficiently in a quantum computing ...
Seyoung Yoon +4 more
core +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Differential Collisions in SHA-1
2020 International Conference on Information Science and Communications Technologies (ICISCT), 2020In paper highlights of hash functions differential cryptanalysis on an example of algorithm SHA-1 are considered. The technique of carrying out of the differential analysis of SHA-1 hash function and other hash functions having a similar structure is offered.
Abdurakhimov Bakhtiyor +3 more
openaire +1 more source
We argue that if the message expansion code of SHA-1 is replaced by a linear code with a better minimum distance, then the resulting hash function is collision resistant. To support this argument, we characterize the disturbance vectors which are used to
Charanjit S. Jutla, Anindya C. Patthak
openaire +2 more sources
Introducing Practical SHA-1 Collisions to the Classroom
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019There is a lack of hands-on exercises in cryptanalysis offered at the university level for a variety of reasons. One reason is the high amount of computations needed to complete cryptanalysis attacks. However, enabling students to perform fixed prefix SHA-1 collision attacks on PDFs does not require any advanced computation power. This paper presents a
Monique Mezher, Ahmed Ibrahim 0004
openaire +1 more source

