Results 11 to 20 of about 168,612 (205)
Analysis of Step-Reduced SHA-256 [PDF]
This is the first article analyzing the security of SHA-256 against fast collision search which considers the recent attacks by Wang et al. We show the limits of applying techniques known so far to SHA-256. Next we introduce a new type of perturbation vector which circumvents the identified limits.
Florian Mendel +3 more
openaire +3 more sources
Attacking Reduced Round SHA-256 [PDF]
The SHA-256 hash function has started getting attention recently by the cryptanalysis community due to the various weaknesses found in its predecessors such as MD4, MD5, SHA-0 and SHA-1. We make two contributions in this work. First we describe message modification techniques and use them to obtain an algorithm to generate message pairs which collide ...
Somitra Kumar Sanadhya +1 more
openaire +4 more sources
Custom ASIC Design for SHA-256 Using Open-Source Tools [PDF]
The growth of digital communications has driven the development of numerous cryptographic methods for secure data transfer and storage. The SHA-256 algorithm is a cryptographic hash function widely used for validating data authenticity, identity, and ...
Lucas Daudt Franck +4 more
doaj +2 more sources
SHA-256 Collision Attack with Programmatic SAT [PDF]
To appear in the 2024 Proceedings of the International Workshop on Satisfiability Checking and Symbolic ...
Nahiyan Alamgir +2 more
openaire +3 more sources
The rapid expansion of Internet of Things (IoT) devices has heightened the demand for lightweight and secure cryptographic mechanisms suitable for resource-constrained environments.
Iain Baird +4 more
doaj +3 more sources
Second-Order Differential Collisions for Reduced SHA-256 [PDF]
In this work, we introduce a new non-random property for hash/compression functions using the theory of higher order differentials. Based on this, we show a second-order differential collision for the compression function of SHA-256 reduced to 47 out of 64 steps with practical complexity. We have implemented the attack and provide an example.
Alex Biryukov +3 more
openaire +4 more sources
Provably secure keyless hash function uses Random Oracle (RO) or Sponge principles for the design and construction of security-centric hash algorithms. It capitalizes the aforesaid principles to produce outcomes like MD2, MD5, SHA-160, SHA-224/256, SHA ...
P. Karthik, P. Shanthi Bala
doaj +1 more source
Construction and Analysis of SHA-256 Compression Function Based on Chaos S-Box
To further improve the security of SHA-256, a compression function construction scheme based on chaotic S-box is proposed. Through the reasonable design of the iteration mode and using the nonlinearity, confusion, and anti-difference of chaotic S-box ...
Juan Wang, Ge Liu, Yongqi Chen, Shu Wang
doaj +1 more source
The Internet of Things (IoT) as an important technology consists of a heterogeneous and huge number of devices that generates an enormous amount of data in various applications.
Arkan A. Saffer +2 more
doaj +1 more source
Linear and Differential Cryptanalysis of SHA-256
The one-way hash function plays an important role in digital signatures and message authentication from the viewpoint of security. No effective attacking method has been discovered to the algorithm of hash function standard. In this study, we tried to attack SHA-256 in encryption mode using linear and differential cryptanalysis to solve a private key ...
Wang, Xiao Dong, 石川, 洋文
openaire +1 more source

