Results 11 to 20 of about 21,838,242 (247)
Preimages for Step-Reduced SHA-2 [PDF]
In this paper, we present preimage attacks on up to 43-step SHA-256 (around 67% of the total 64 steps) and 46-step SHA-512 (around 57.5% of the total 80 steps), which significantly increases the number of attacked steps compared to the best previously published preimage attack working for 24 steps.
Kazumaro Aoki+4 more
openalex +3 more sources
Time–space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 [PDF]
Performance of cryptanalytic quantum search algorithms is mainly inferred from query complexity which hides overhead induced by an implementation. To shed light on quantitative complexity analysis removing hidden factors, we provide a framework for ...
Panjin Kim, Daewan Han, Kyung Chul Jeong
openalex +3 more sources
Multi-mode operator for SHA-2 hash functions [PDF]
We propose an improved implementation of the SHA-2 hash family, with minimal operator latency and reduced hardware requirements. We also propose a high frequency version at the cost of only two cycles of latency per message. Finally we present a multi-mode architecture able to perform either a SHA-384 or SHA-512 hash or to behave as two independent SHA-
Ryan Glabb+4 more
openalex +4 more sources
In this note, we provide the first 22-step collisions for SHA-256 and SHA-512. Detailed technique of generating these collisions will be provided in the next revision of this note.
Somitra Kumar Sanadhya, Palash Sarkar
openalex +4 more sources
A new hash family obtained by modifying the SHA-2 family [PDF]
In this work, we study several properties of the SHA-2 design which have been utilized in recent collision attacks against reduced round SHA-2. Small modifications to the SHA-2 design are suggested to thwart these attacks. The modified round function provides the same resistance to linearization attacks as the original SHA-2 round function, but ...
Somitra Kumar Sanadhya, Palash Sarkar
openalex +2 more sources
Carry-based Differential Power Analysis (CDPA) and its Application to Attacking HMAC-SHA-2
In this paper, we introduce Carry-based Differential Power Analysis (CDPA), a novel methodology that allows for attacking schemes that use arithmetical addition. We apply this methodology to attacking HMAC-SHA-2.
Yaacov Belenky+6 more
openalex +3 more sources
Exhibiting SHA[2] on hyperelliptic Jacobians
Abstract We discuss approaches to computing in the Shafarevich–Tate group of Jacobians of higher genus curves, with an emphasis on the theory and practice of visualisation. Especially for hyperelliptic curves, this often enables the computation of ranks of Jacobians, even when the 2-Selmer bound does not bound the rank sharply.
Nils Bruin, E. V. Flynn
openalex +6 more sources
Preimage Attacks on Reduced Tiger and SHA-2 [PDF]
This paper shows new preimage attacks on reduced Tiger and SHA-2. Indesteege and Preneel presented a preimage attack on Tiger reduced to 13 rounds (out of 24) with a complexity of 2128.5. Our new preimage attack finds a one-block preimage of Tiger reduced to 16 rounds with a complexity of 2161. The proposed attack is based on meet-in-the-middle attacks.
Takanori Isobe, Kyoji Shibutani
openalex +3 more sources
Study Security Cloud with SHA-2 Algorithm
This study explores the relationship between cloud computing and security, concentrating on the use of the SHA-2 cryptographic algorithm. Due to the distributed and shared nature of cloud settings, cloud computing has transformed how information and services are accessed and provided. However, it has also created new security issues.
Arnes Yuli Vandika
openalex +4 more sources
Simulation Analysis and Comparison of New Hybrid TLI-µTESLA and Variant TESLA Protocols Using SHA-2 and SHA-3 Hash Functions. [PDF]
Eledlebi K+5 more
europepmc +3 more sources