Skip to content
Free planNo credit card requiredStart writing

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 1,757 papers for “Secure Hash Algorithm”

IoT Storage Optimisation Security Framework Based on a Secure Hash Algorithm

Aditiya Agnihotri · Türk bilgisayar ve matematik eğitimi dergisi · 2018

The purpose of this research is to examine the risks that IoT applications encounter throughout operational operations, data routing, and energy utilisation, as well as potential solutions to these problems utilising Blockchain technology. This study is broken up into four parts: finding a secure hash technique for the huge volumes of data produced by IoT devices; improving storage; using cluster-based routing to keep out unwanted visitors; and safeguarding IoT programmes. The trust of the blockchain node to existing applications for the Internet of Things cannot be assured, and a sizable amount of communication assets would be used in the process of achieving consensus using the proposed security evolution method of Hybrid Cryptographic Hash Function (HCHF). Private Consensus Bitcoin with Hybrid Cryptographic Hash Function (HCHF) Enhanced Trust on Multilink was a newly developed consensus method in this study. The following are some of the key features of the IoT applications that make use of the suggested HCHF method: 1) The confidence of the nodes in the IoT application grew as a result of the development of the trust attribute mechanism, leading to the formation of a grouping structure within the network. The trust in the system is boosted by the grouping adjustment mechanism. Second, the complexity of communication is considerably simplified by categorising nodes according to their level of trust. The experimental findings show that the system's communication effectiveness and overall trust may be greatly increased by the blockchain's application of the upgraded method.

Cited by 0Open access

Hardware Design and Implementation of Secure Hash Algorithm Based on FPGA

M. F. Al-Gailani · Journal of Internet Services and Information Security · 2025

The Secure Hash Algorithm is an essential part of data security. It has numerous applications, the most important of which is data integrity, which ensures that the received data matches the transmitted data and has not been tampered with during transmission or storage. Achieving data security often requires the use of a combination of algorithms and protocols to ensure data confidentiality, integrity, and authenticity. Therefore, a hardware implementation is the optimal solution to meet data security requirements and implement these algorithms in a coordinated and time-efficient manner, ensuring high execution speed compared to software implementation. In this research paper, hardware is designed for SHA-2 and implemented on a Xilinx XC7VX330T-3FFG1761 device using Xilinx ISE 14.7. The architecture is designed for message digest lengths of 256 and 512 bits. It is also suitable for other SHA-2 families by truncating the extra bits. The design aims to optimize performance with minimal complexity to suit resource-constrained devices and applications. Therefore, an iterative looping architecture was initially chosen to achieve this goal. Implementation results of the proposed architecture were satisfactory, with a throughput of 1.021 Gbps for SHA-256 and 1.331 Gbps for SHA-512. In addition, the number of slice registers was 333 for SHA-256 and 699 for SHA-512. The total power consumption for implementing the architecture was 0.394 W for SHA-256 and 0.608 W for SHA-512. A hybrid architecture for SHA-256 was then designed by replicating the hardware of a single round two and four times, allowing for the processing of two and four rounds per iteration. This reduces the number of iterations by half and a quarter, improving performance and increasing throughput by approximately 63% and 87% while increasing the number of slices LUTs and the number of occupied slices by only 5% and 30% (for unfolded 2), and 12% and 34% (for unfolded 4).

Cited by 0Open access

A Secure Hash Algorithm with only 8 Folded SHA-1 Steps

2013

We propose a new design principle for construction of iterated cryptographic hash functions: computations in the iterative part of the compression function to start with variables produced in the message expansion part that have complexity level of a random Boolean function. Then we show that to reach the cryptographic strength that will withstand all currently known techniques for finding collisions, much lower number of iterations is necessary. Concretely we use the recently proposed nonlinear technique “Quasigroup Fold ” together with the mentioned principle to design a hash function that has only 8 iterative steps. Besides increasing the security, the reference C code for the obtained hash function shows that it is at least 3% faster than original reference code for SHA-1. Key words: SHA-1,SHA-2, hash, quasigroup folding

Cited by 0

Secure Hash Algorithm SHA-256 Based Hardware Acceleration Using Spartan-6

Hitesh M A, R, Mahendra, Sumanth H S et al. · Zenodo (CERN European Organization for Nuclear Research) · 2023

Recently, there have been many technological advancements in communication, particularly in online transactions, increasing the necessity for highly secure networks and transactions. The number of cryptographic algorithms has expanded. Cryptographic hash functions are used to secure and authenticate data and transactions. SHA-256 (Secure Hash Algorithm-256) is a one-way hash function that is both secure and quick, with a high collision resistance. In this work SHA-256 hardware architecture with minimal power consumption and area based on a sequential calculation of the message scheduler and working variables. The hardware was designed in HDL and built on a SPARTAN-6 FPGA, which provides exceptional efficiency and performance. Different optimization techniques, such as gated clock conversion, arithmetic resource sharing, and structural modelling of small building blocks, were employed to further reduce power and area. The proposed design ran with a maximum frequency of 83.33 MHz the implementation reports indicated a dynamic power consumption of 14 mW and area utilization of 505 slices while maintaining a good throughput of 2659.42 G bits/s and a relatively high efficiency of 5.266 M bits/s per slice.

Cited by 0Open access

SECURE DATA TRANSMISSION USING LAYERED HASH ENCRYPTION ALGORITHM FOR IOT DEVICES

Mr. Faheemuddin Ahmed, Dr. N.S. Ratnaparkhi · Zenodo (CERN European Organization for Nuclear Research) · 2025

Abstract The evolution of the Secure Hash Algorithm (SHA) family reflects the ongoing advancements incryptographic security and the response to emerging vulnerabilities. Initially introduced in 1993with SHA-0, the algorithm was quickly withdrawn due to flaws. SHA-1, released in 1995, gainedwidespread adoption but was later found to be susceptible to collision attacks, leading to itsdeprecation. In response, SHA-2 was introduced in 2001, encompassing a suite of hash functions(SHA-224, SHA-256, SHA-384, SHA-512) that offered enhanced security and resistance toattacks, making it the standard for many applications. The latest addition, SHA-3, standardizedin 2015, is based on the Keccak algorithm and provides a different construction method, furtherdiversifying the cryptographic landscape. The analysis of these algorithms has revealed varyinglevels of security and performance, with SHA-2 and SHA-3 currently regarded as secure againstknown attack vectors. As the field of cryptography evolves, particularly with the advent ofquantum computing, ongoing research aims to develop even more robust hashing techniques toensure data integrity and security in an increasingly digital world.This paper addresses the growing concern of secure data transmission within the Internet ofThings (IoT) ecosystems. The rapid expansion of IoT devices requires secure, error-freecommunication to safeguard sensitive data. This research proposes an IoT communicationframework that leverages Raspberry Pi as an accessible hardware platform for IoT devices andgateways. The core of this framework relies on the implementation of the custom layered SHA-3hash encryption algorithm to ensure the integrity and authenticity of transmitted data.Furthermore, secure storage through AWS DynamoDB and near real-time data visualizationusing Grafana are integrated to enhance the practicality of the solution. This research presents aholistic approach to IoT data transmission security, offering scalable and effective solutions forboth small-scale and large-scale IoT deployments.

Cited by 0Open access

Design and Implementation Secure Hash Algorithm 3 (SHA-3) using FPGA

Ali Hussein Jasim, Dalal Abdulmohsin Hammood, Ali Al-Askery · 2023

In this moment the world an instant communication technology, security has become extremely significance factor. It is crucial in system with communication fields that the cryptograph mechanism is intricated. The procedures intricate the creation of a hash function, that is a one-way encrypted code used in data security. The most common examples the Digital signatures, the MAC (message authentication codes), with the smart cards. Secure Hash Algorithm (SHA-3) is a new typical cryptograph Keccak hash function that is not vulnerable for the attacks. In this paper, we presented software simulation for optimization techniques on Keccak SHA-3 algorithm using the (VHDL) programming language with the output length for the Keccak hash function is (256). And the design as simulation was implemented on FPGA. implementation procedure is quick with the efficient ratio. algorithm's goals are to increase throughput and decrease area.

Cited by 4

Secure Smart Home Data by Using Blockchain Technology with Hash Algorithm

S Lukesh, J Jagadesh, V. Pandimurugan · 2024

The project “Secure Smart Home Data by Using Blockchain Technology with Hash Algorithm” focuses on incorporating two timeless technological concepts that is, blockchain and secure hash algorithms. Smart home is a concept that is been trending these days with IoT devices taking control of the houses making people's lives much easier. But the data collected from them is not stored properly. With the traditional methodology where the data is stored on a centralized cloud network, it is prone to cyberattacks, single point of failure and also involves tampering. Because of this, the sensitive data of the users are compromised from time to time. This arises mainly due to the centralized network system of the cloud and to tackle that, we approached a decentralized network system which Blockchain. It enables us to store data across the world that too in a decentralized format resulting in a more secure and safe environment for those sensitive data. This is our proposed solution as well. To secure the smart home data with blockchain technology and to further enhance reliability, our proposed approach incorporates a modified version of SHA-512. In summary, our focus is on securing Smart Home IoT data in the cloud by integrating blockchain technology, advanced encryption methods, and robust hash algorithms like SHA-512 to ensure the utmost protection and authorized access for large-scale datasets from diverse Smart Home sources.

Cited by 0

Secure and Efficient Hash Based Finishing Algorithm for Real Random Numbers

Selman Yakut, Ahmet Bedri Özer · 2018

Random numbers are the most important part of many applications, such as cryptographic applications, games of chance, game theory. The security of these applications is provided by secure random numbers. These secure numbers are true random and are generated from entropy sources. In the study, a post-processing algorithm is proposed for real random number generators. The last operation is the Keccak hash algorithm. Chaotic systems that used random characters for production of raw random numbers were used. With this method, safe random numbers were generated by applying the proposed post-processing algorithm. The numbers generated were shown that they did not contain statistical weaknesses by using NIST and autocorrelation tests, Moreover; the proposed finishing algorithm is more efficient than the other finishing methods. As a result, an efficient post-processing algorithm is devised which is safe for real random number generators.

Cited by 2

Esha-256: An Enhanced Secure Cryptographic Hash Algorithm for Information Security

S. Sathiya Devi, K. Jayasri · 2023

Due to the exponential growth of digital data the need for security and authenticity plays an important role in various applications. Hence an effective method is required to protect the data, one such method is Secure Hash Algorithm (SHA-256). The SHA-256 is a strong and secure algorithm providing authenticity and digital signature. Though SHA-256 has security, reliability and strong collision resistance features, it is vulnerable to Algebraic Fault Analysis (AFA) and Differential Fault Analysis (DFA) attacks. It also requires longer processing time for hash generation. In order to overcome the above mentioned drawbacks, this study proposes a method called Enhanced Secure Hash Algorithm (ESHA-256) with less computation time and more security. The proposed ESHA-256 has 32 rounds and modified compression function for hash generation. In this method, initially the 64 word vectors are reduced into 32 by applying XOR with adjacent word vectors and the resulting 32 word vectors are given as an input to all the rounds. The compression function is modified by incorporating the first 32-bit fractional segment of cube root of initial 64 primes as two parts. The experimental results of proposed ESHA-256 produces the hash with minimum time which is 53% less when compared existing SHA-256 and also highly resistance to AFA and DFA attacks.

Cited by 1

Hash-based message authentication code with secure hash algorithm-256 for efficient data sharing in blockchain

Naveenkumar Lingaraju, S. H. Manjula · Indonesian Journal of Electrical Engineering and Computer Science · 2025

Recently, <span lang="EN-US">cloud servers have increasingly been utilized for storing a large amount of data, which is stored in the form of ciphertext. In a decentralised system, the communication overhead on the network is recognized as the main problem due to the numerous transaction data recorded across the data Sharding and nodes with authorized users. Hash-Based Message Authentication Code with Secure Hash Algorithm-256-bit (HMAC-SHA-256 bit) is proposed for secure and effective data sharing in blockchain to overcome this issue. The secure algorithm HMAC serves for authenticating both the data origin and integrity. That uses a cryptographic hash procedure in combination with a confidential key to validate both the verification and tamper-proof content of a message. HMAC consists of a particular content and an authentication key with a hashing code value. In the Blockchain framework, the HMAC algorithm is utilized with the SHA-256bits to generate and validate the signatures of many transactions. SHA-256 is a hash algorithm that creates a 256-bit cryptographic checksum. The blockchain uses HMAC along with SHA-256bits, which is a safe and clearly expressed algorithm to allocate or convey the data securely. The Authentication of HMAC-SHA-256bits achieves the optimal retrieval times of 0.4s, 1.0s, 1.5s, 1.9s, 2.2s, and 2.8s for file sizes of 50KB, 100KB, 150KB, 200KB, 250KB, and 300KB, correspondingly, when compared to interplanetary file system </span>(IPFS).

Cited by 0Open access

IMPLEMENTASI DIGITAL SIGNATURE ALGORITHM (DSA) MENGGUNAKAN SECURE HASH ALGORITHM-256 (SHA-256) PADA MEDIA GAMBAR

Sahl Fawzy Sutopo, - · Repository at Universitas Pendidikan Indonesia (Universitas Pendidikan Indonesia) · 2020

With the development of technology, documents not only produced in printed form but also produced in digital form, especially image documents. The advantage of digital documents is that they are easier and more efficient to use but digital documents are also easy to fake. To overcome this, a digital document security technique is needed, that is the document is digitally signed. This study aims to explain the process of implementing Digital Signature Algorithm by using the Secure Hash Algorithm-256 as hash function on image file and designing digital signature programs.
\n
\nThe results of this study indicate that the Digital Signature Algorithm (DSA) using the Secure Hash Algorithm-256 hash function can’t only be implemented in text messages, but can be implemented in image file by the method of image conversion to ASCII images. DSA can also be programmed using the Python programming language to facilitate the generation and authentication of signatures.

Cited by 0Open access

Investigating the Utilization of the Secure Hash Algorithm to Generate Electromagnetic Noise

Ibraheem Frieslaar, Barry Irwin · 2017

This research introduces an electromagnetic (EM) noise generator known as the FRIES noise generator to mitigate and obfuscate Side Channel Analysis (SCA) attacks against a Raspberry Pi. The FRIES noise generator utilizes the implementation of the Secure Hash Algorithm (SHA) from OpenSSL to generate white noise within the EM spectrum. This research further contributes to the body of knowledge by demonstrating that the SHA implementation of libcrypto++ and OpenSSL had different EM signatures. It was further revealed that as a more secure implementation of the SHA was executed additional data lines were used, resulting in increased EM emissions. It was demonstrated that the OpenSSL implementations of the SHA was more optimized as opposed to the libcrypto++ implementation by utilizing less resources and not leaving the device in a bottleneck. The FRIES daemon added noise to the EM leakage which prevents the visual location of the AES-128 cryptographic implementation. Finally, the cross-correlation test demonstrated that the EM features of the AES-128 algorithm was not detected within the FRIES noise.

Cited by 0

TDHA: A Timestamp Defined Hash Algorithm for Secure Data Dissemination in VANET

Atanu Mondal, Sulata Mitra · Procedia Computer Science · 2016

The safety application in vehicular ad hoc network provides active road safety to avoid road accidents by disseminating life critical information among drivers securely. Such information must be protected from the access of intruder or attacker. A timestamp defined hash algorithm is proposed in the present work for secure data dissemination among vehicles. The sender vehicle sends a deformed version of the original message along with the incomplete message digest to its neighbors. The receiver vehicle generates message digest from the deformed version of the original message and also from the incomplete message digest. It accepts the message if both the digests are equal. The proposed algorithm fulfils all the basic properties such as preimage resistance, collision resistance of a one-way unkeyed hash function. Finally the comparative usability of the hash algorithm in the said application domain is worked out and that shows the dominance of the scheme over the existing schemes.

Cited by 10Open access

Design and Implementation Digital Invitation System Based on Secure Hash Algorithm 3

Ismael Abdul Sattar Jabbar, Hassan Kassim Albahadily, Alaa A. Jabbar Altaay · International Journal of Online and Biomedical Engineering (iJOE) · 2023

Digital invitation system become one of the important systems due to the pandemic consequences specially in E-learning domains. The digital invitation needed to be secure enough for several reasons specially in the user demands. In this paper designed and implemented a digital invitation system based on secure hash algorithm which achieving multilevel of security. The first security level, that is the hash code generated for the digital invitation link used in the encryption process not only for the invitation date but also for the invitation time. on the other hand, the second security level achieved through out using the hash code as map for the hiding mechanism. The generated hash will be used for the data integrity as well. The proposed system evaluating the final stego-image as digital invitation using PSNR metric and the maximum value reach 64.28 while the minimum value reach 58.21.

Cited by 1Open access