Results 161 to 170 of about 12,741,900 (205)

A High-Throughput Hardware Implementation of SHA-256 Algorithm

2020 IEEE International Symposium on Circuits and Systems (ISCAS), 2020
The SHA-256 algorithm is widely used in the field of security. In this paper, we propose a rescheduling method for the SHA-256 round computation. Based on the proposed rescheduling, we propose a design for SHA-256, in which the critical path is reduced. Our design is implemented on the Xilinx Virtex-4 FPGA.
Yimeng Chen, Shuguo Li
openaire   +2 more sources

An optimized pipelined architecture of SHA-256 hash function

2017 7th International Symposium on Embedded Computing and System Design (ISED), 2017
Real time applications of digital communication systems are rapidly increasing. Due to this there is a huge demand for high level of security. In cryptographic algorithms, SHA-256 has become an integral part in many applications. A hardware implementation of the SHA-256 hash algorithm is physically separate from the main processor and hence, it has ...
Meelu Padhi, Ravindra Chaudhari
openaire   +1 more source

Multiple Hashing Using SHA-256 and MD5

2021
Message Digest 5 (MD5) is a hashing function with numerous vulnerabilities such as pre-image vulnerability and collision vulnerability which restrict the usage of MD5. Therefore, by using other hashing functions such as SHA prior to hashing with MD5, we can use MD5 for various applications such as data integrity without compromising the security of the
Gautham P. Reddy, Anoop Narayana, P. Karan Keerthan, B. Vineetha, Prasad Honnavalli   +4 more
openaire   +1 more source

Designing a SHA-256 processor for blockchain-based IoT applications

Internet of Things, 2020
Abstract An increasing number of Internet of Things applications have been recently considering the use of the blockchain technology, calling for dedicated computational capabilities of the underlying devices. This poses an inherent challenge in an application domain notoriously characterised by several, often stringent limitations in terms of ...
Martino, Raffaele, Cilardo, Alessandro
openaire   +3 more sources

VLSI implementation of high-speed SHA-256

2009 IEEE 8th International Conference on ASIC, 2009
To accelerate the speed of iterative computation for the existing SHA-256 algorithm, using 7-3-2 array compressor is proposed to reduce the critical path delay in this paper. The frequency of the proposed scheme is 1.7 times higher than other VLSI implementations under the same process.
null Ling Bai, null Shuguo Li
openaire   +1 more source

An optimized hardware implementation of SHA-256 round computation

The Computer Journal
Abstract The SHA-256 algorithm is one of the most widely used secure hashing algorithms. The SHA-256 algorithm is implemented in hardware, and in order to ensure the integrity and authenticity of the encrypted data, this requires higher throughput and efficiency.
Maoqun Yao, Ziwei Xue, Haiwei Li, Shanhu Shen   +3 more
openaire   +1 more source

Comparative Study of Sha-256 Optimization Techniques

2022 IEEE World AI IoT Congress (AIIoT), 2022
Bharat S. Rawal, Lingampally Shiva Kumar, Sriram Maganti, Varun Godha   +3 more
openaire   +2 more sources

Algorithm for simplifying the SHA-256 operations tree

2023 IEEE International Conference on Cyber Security and Resilience (CSR), 2023
Andrey I. Plotnikov, Alla Levina
openaire   +2 more sources

SHA-256 FALL: THE KAORU BRIDGE ATTACK A Complete Algebraic Inversion Framework for SHA-256

In this paper, I present a complete algorithmic framework for inverting SHA-256 through algebraic manipulation of internal state variables. I introduce The Kaoru Bridge - a three-phase methodology for recovering preimages from arbitrary SHA-256 hashes via carry vector extraction, reverse chain unrolling, and constraint-based validation.
openaire   +1 more source

Improving Local Collisions: New Attacks on Reduced SHA-256

2013
In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and show how to turn them into collisions. We present a collision attack on 28 steps of the hash function with practical complexity. Using a two-block approach we are able to turn a semi-free-start collision into a collision for 31 steps with a complexity of at most ...
Florian Mendel, Tomislav Nad, Martin Schläffer   +2 more
openaire   +3 more sources