Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

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”

Detecting Compromised Sensor Using Secure Hash Algorithm in WSN

T Devapriya, V. Ganesan, S. Velmurugan · 2025

Securing the integrity of Wireless Sensor Networks (WSNs) is essential to avert malicious attacks and unauthorized data alterations. The objective is to provide a reliable detection system for identifying hacked sensor nodes with the Secure Hash Algorithm (SHA)-512 algorithm. The aim is to provide secure data transfer, improve authentication procedures, and identify abnormalities that suggest possible node intrusion. Utilizing SHA-512, an advanced cryptographic hashing method, the identities of sensor nodes are authenticated, thwarting unauthorized modifications and guaranteeing data integrity. The objective is to provide a lightweight yet robust security architecture that reduces computing burden while delivering strong cryptographic safeguards against unauthorized access. The effective verification of sensor nodes facilitates fast threat detection, reduces the probability of erroneous data injection, and enhances network resilience. Enhancing security procedures with SHA-512 improves overall WSN confidentiality, integrity, and reliability, making it a strong option for applications requiring high-security requirements, such as healthcare monitoring, environmental sensing, and industrial automation.

Cited by 0

Penerapan Algoritma Secure Hash Algorithm (SHA) Keamanan Pada Citra

Hermansyah Sembiring, Fuzy Yustika Manik, Tengku Zaidah · MEANS (Media Informasi Analisa dan Sistem) · 2019

Current information exchange is not only in the form of text, it can be an image or video. All of that can be done using computer network technology in the form of the internet. Through an internet connection, you can connect with many people. Cryptography aims for messages or images that cannot be seen by other parties who have no interest in the information. Messages or secured images can be data stored in secure computer memory or sent through computer networks. And can protect the confidentiality of images from various threats that arise. To maintain data security, SHA-256 is used when transforming data bytes into string hashes. The system built has been able to implement the SHA 256 algorithm which can change the original image file in the form of unknown files and encrypted images that are difficult to know the original image, unless read using an application that has been built. the image when encrypted and used again at the time of decryption with as many as 45 characters and may be in the form of numbers or letters. The SHA 256 process when encrypted in only one round, can be played with decryption.

Cited by 4Open access

Design and Analysis of Hash Algorithm Using Autonomous Initial Value Proposed Secure Hash Algorithm64

Babasaheb Ambedkar, Prabhat Kumar Bharti, Akhtar Husain · 2021 IEEE 18th India Council International Conference (INDICON) · 2021

A secure hash code or message authentication code is a one-way hash algorithm. It is producing a fixed-size hash function to be used to check verification, the integrity of electronic data, password storage. Numerous researchers have proposed hashing algorithms. They have a very high time complexity based on several steps, initial value, and key constants which are publically known. We are focusing here on the many exiting algorithms that are dependent on the initial value and key constant usage to increasing the security strength of the hash function which is publically known. Therefore, we are proposing autonomous initial value proposed secure hash algorithm (AIVPSHA64) in this research paper to produce sixty-four-bit secure hash code without the need of initial value and key constant, it is very useful for a smart card to verify their identity which has limited memory space. Then evaluate the performance of hash function using autonomous initial value proposed secure hash algorithm (AIVPSHA64) and will compare the result, which is found by python-3.9.0 programming language.

Cited by 8

ENKRIPSI TERAUTENTIKASI DENGAN CHACHA20 DAN HASH-BASED MESSAGE AUTHENTICATION CODE SECURE HASH ALGORITHM 256

- Syifa Fatmawati, - Rini Marwati, - Dewi Rachmatin · Repository at Universitas Pendidikan Indonesia (Universitas Pendidikan Indonesia) · 2025

Perkembangan teknologi yang pesat mendorong data disimpan dalam bentuk file digital dengan berbagai format. Namun, tidak semua format file memiliki proteksi bawaan. Oleh karena itu, keamanan dan integritasnya perlu untuk dijaga agar terhindar dari serangan siber. Untuk mengatasi hal tersebut, teknik kriptografi berupa enkripsi terautentikasi digunakan untuk menjaga kerahasiaan dan integritas data secara bersamaan. Enkripsi terautentikasi merupakan gabungan dari algoritma enkripsi dan autentikasi. Penelitian ini menggunakan ChaCha20 sebagai algoritma enkripsi dan Hash-based Message Authentication Code Secure Hash Algorithm 256 (HMAC SHA-256) sebagai algoritma autentikasi. Kedua algoritma tersebut digabungkan menggunakan skema Encrypt-then-MAC. Skema ini bekerja dengan cara mengenkripsi file sehingga menghasilkan cipherteks. Lalu, cipherteks tersebut dihitung nilai MAC-nya dan disisipkan pada cipherteks. Nilai MAC tersebut digunakan untuk memverifikasi perubahan data pada file sebelum didekripsi. Program aplikasi enkripsi terautentikasi dengan ChaCha20 dan HMAC SHA-256 dikonstruksi menggunakan bahasa pemograman Python. Hasil penelitian menunjukkan bahwa program tersebut dapat mengamankan file dalam berbagai format serta dapat mendeteksi perubahan pada file sehingga integritasnya dapat terjaga. Rapid technological developments encourage data to be stored in digital files in various formats. However, not all file formats have built-in protection. Therefore, their security and integrity need to be maintained to avoid cyber attacks. To address this issue, cryptographic techniques specifically authenticated encryption is used to simultaneously maintain data confidentiality and integrity. Authenticated encryption is a combination of encryption and authentication algorithms. This study uses ChaCha20 as the encryption algorithm and Hash-based Message Authentication Code Secure Hash Algorithm 256 (HMAC SHA-256) as the authentication algorithm. These two algorithms are combined using the Encrypt-then-MAC scheme. This scheme works by encrypting a file to produce ciphertext. Then, the ciphertext's MAC value is calculated and embedded into the ciphertext. The MAC value is used to verify data changes in the file before decryption. The authenticated encryption application program with ChaCha20 and HMAC SHA-256 is constructed using the Python programming language. The research results show that the program can secures files in various formats and detects file modification so that their integrity can be maintained.

Cited by 0

OPTIMIZING CRYPTOGRAPHIC HASH FUNCTION PERFORMANCE THROUGH AN EXTENDED SECURE HASH ALGORITHM (2080-BIT VARIANT)

Nisha Verma, V. T. Rajan · International Journal of Cyber Threat Intelligence and Secure Networking · 2025

Cryptographic hash functions are fundamental to ensuring data integrity, authentication, and security in digital systems. This paper introduces and evaluates an extended 2080-bit variant of the Secure Hash Algorithm, designed to enhance resistance against collision, preimage, and length-extension attacks while maintaining computational efficiency. The proposed algorithm incorporates dynamic message expansion, multi-stage compression, and parallel processing techniques to optimize performance across diverse hardware architectures. Benchmarking results reveal that the 2080-bit variant outperforms conventional SHA families in both throughput and cryptographic strength, making it suitable for high-security applications such as blockchain, digital forensics, and secure communications. This study advances the development of robust, scalable hash functions for future-proof security systems.

Cited by 0Open access

Instruction sequence expressions for the secure hash algorithm SHA-256

J.A. Bergstra, C.A. Middelburg · arXiv (Cornell University) · 2013

The secure hash function SHA-256 is a function on bit strings. This means that its restriction to the bit strings of any given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers, forward jump instructions, and a termination instruction. We describe such instruction sequences for the restrictions to bit strings of the different possible lengths by means of uniform terms from an algebraic theory.

Cited by 10Open access

A fast portable implementation of the Secure Hash Algorithm, III.

Kevin S. McCurley · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1992

In 1992, NIST announced a proposed standard for a collision-free hash function. The algorithm for producing the hash value is known as the Secure Hash Algorithm (SHA), and the standard using the algorithm in known as the Secure Hash Standard (SHS). Later, an announcement was made that a scientist at NSA had discovered a weakness in the original algorithm. A revision to this standard was then announced as FIPS 180-1, and includes a slight change to the algorithm that eliminates the weakness. This new algorithm is called SHA-1. In this report we describe a portable and efficient implementation of SHA-1 in the C language. Performance information is given, as well as tips for porting the code to other architectures. We conclude with some observations on the efficiency of the algorithm, and a discussion of how the efficiency of SHA might be improved.

Cited by 7Open access

US Secure Hash Algorithm 1 (SHA1) Status of this Memo

Group D. Eastlake, P. Jones, Tony Hansen et al. · 2001

This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Copyright Notice

Cited by 0

Secure Cloud Computing using Blockchain with Verkle Tree Hash algorithm

Imran Shahid Shaikh · International Journal of Scientific Research in Science and Technology · 2024

Cloud computing permits you to avoid the need to install your own dedicated servers machines, run your own software, and manage your own databases. You can access data, applications, and computing hardware resources from anywhere in the world, rather than needing to be installed in office. As a result, the cloud offers faster innovation, flexible resources, and economies of scale. A rapid growth in Cloud Computing adaption observed but, still, the data security concerns in cloud are not addressed. In parallel Blockchain, technology is an emerging technology makes it impossible or difficult for the system to be changed, hacked, or manipulated. This paper enlightening the various aspects of security in Blockchain and Cloud Computing.

Cited by 0Open access

Enhance Neighbor Discovery Protocol Security by Using Secure Hash Algorithm

Muhammad Usman, Usman Rauf Kamboh, Muhammad Danish Taqdees et al. · 2021 International Conference on Innovative Computing (ICIC) · 2021

Neighbor Discovery Protocol (NDP) plays a vital role in IPv6. Neighbor Solicitation (NS) and Neighbor Advertisement (NA) are two important messages of NDP. Because these two messages are used in two major processes of NDP; Duplicate Address Detection (DAD) and Address Resolution (AR). DAD is used to assign a unique IPv6 address to a new device attached to the IPv6 link-local network. Whilst, AR works like ARP in IPv4, it is used to find the MAC Address of the device against an IPv6 Address. As the massage is multicast and there is no built-in security in NDP that’s why it has vulnerabilities and due to lack of security any intruder can launch an attack; like the DoS (Denial of Service) attack which is most common. Many researches were conducted to resolve this issue, and techniques were proposed like SeND and Trust-ND. Some of these techniques can stop attacks but still have some vulnerabilities like high processing time and complexity etc. This research aims to introduce a technique that is more effective than already existing methods. This study proposed a security technique name as 64- bits Hash technique, to secure NS and NA messages of NDP by using SHA-512 for the encryption of target IPv6 and the use of only 64-bit of hashed value in NS and NA messages. The experimental results show that the purposed technique consumes less bandwidth and less processing time than other existing techniques to prevent DAD and AR from DoS attacks. The featured work is to implement the purposed technique on other processes of NDP and also to implement it on a large IPv6 network.

Cited by 5

Secure File Sharing System By verifying Data with Hash Algorithm

Mon, Kaung Myat, Khaing, Thiri Thitsar · 2009

The security of information is the most important factor of information technology and communication. Many different methods have been developed to encrypt and decrypt data in order to keep the message secret. Besides, it is needed to verify whether the received data is from right sender or not because malicious user can change the data between data transmission processes. This system is a secure data sending system. In this system, firstly, Asymmetric Algorithm (Diffie-Hellman) is used to produce the symmetric key that will be used in data encryption/decryption process. Next, the system uses Symmetric Algorithm (AES) to encrypt/decrypt file. Furthermore, the system includes the data checking process in which the received data will be checked whether it has been changed on the way or not by using Secure Hash Algorithm (SHA).

Cited by 0

Enhancing the Performance of Cryptographic Hash Function Using 2080 Bits Proposed Secure Hash Algorithm 160

Babasaheb Ambedkar · International Journal of Scientific Research in Network Security and Communication · 2025

An on-way hash code or message authentication code is generated using the cryptographic hash functions. It used to be password storage, electronic data integrity, and check verification. Cryptographic hashing algorithms, which employ beginning value and key constant to boost algorithm complexity, have been proposed by a number of academics. It is well known that they have a very high temporal complexity due to the quantity of steps and memory space needed to store the beginning value and key constants. Consequently, we are improving the cryptographic hash function's performance by using 2080 bits as a block of the input message and avoiding the need for the key constant. By doing this, we are generating 160-bit fixed-length hash code, and the amount of time spent on the function proposal will be reduced in comparison to previous hash algorithms. The outcome will be compared using the amount of time in seconds that the cryptographic hash algorithms consumed during computation.

Cited by 1Open access

Secure Network using Secure Hash Algorithm-3 with Locking Protocol in Distributed Database System

Prerna Gupta, Amit Kumar Verma, B Verma et al. · International Journal of Computer Science Issues · 2017

The two phase locking protocol provides controlled access to a data item and prevents data inconsistencies in the distributed database system. The hashing algorithm is used to calculate hash value for the requested data item and the generated hash value is used as a medium to secure the communication between server and client connected through a network. This paper presents a methodology which is used to secure network of a distributed database system while processing requests for data items from various users at the same time. The concurrency control issues are resolved using two phase locking protocol and the security issue is resolved using secure hash algorithm-3, 512 variant. By performing extensive experiments, the performance of the proposed method is epitomized. Performance parameters like throughput, accuracy are calculated to compare the proposed methodology with the hash based optimistic concurrency control algorithm.

Cited by 1Open access

Enhancing the Performance of Hash Function Using Autonomous Initial Value Proposed Secure Hash Algorithm 256

Babasaheb Ambedkar, Prabhat Kumar Bharti, Akhtar Husain · 2022 IEEE 11th International Conference on Communication Systems and Network Technologies (CSNT) · 2022

To verify the integrity and confidentiality of data communicated through the web is a very big issue worldwide because every person wants very fast computing and secure electronic data communication via the web. The authentication of electronic data is done by hashing algorithms. Presently researchers are using one-time padding to convert variable-length input messages into a block of fixed length and also using constant initial values that are constant for any input message. So this reason we are proposing the autonomous initial value proposed secure hash algorithm-256 (AIVPSHA256) and we are enhancing the performance of the hash function by designing and compuiting its experimental results in python 3.9.5 programming language.

Cited by 2