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”

Secure Hash Algorithm-1

National Cancer Institute · Definitions · 2020

Ope n Pe e r v ie w on Qe ios Ope n Pe e r Re v ie

Cited by 0Open access

Generalized secure hash algorithm: SHA-X

Chu-Hsing Lin, Chen‐Yu Lee, Yi‐Shiung Yeh et al. · 2011

This paper defines a generalized SHA algorithm based on the SHA family rules. The proposed algorithm accepts arbitrary length message as input to generate message digest with the required length. It contains the initial values, constant values, padding, parsing, as well as the generalized main body. Further, the proposed algorithm solves the Length-of-the-Hash-Value (LHV) problem that occurs when SHA-r cannot be expressed as r = mn uniquely.

Cited by 14

Secure Hash Algorithm (SHA)-1 to

2008

Even though the vulnerability countshave dropped, the number of vulner-abilities is not zero. And, even in my wildest dreams, I do not think we will get to zero. I will explain why shortly. In the very early days of the SDL, Microsoft focused heavily on removing design and code-level security vulnerabili-ties; as we progressed, we added processes that help reduce the chance that new vul-nerabilities get added to the software. Examples of implementation require-ments in the SDL include: • Use of code analysis tools on develop-er’s desktops to find security vulnera-bilities. • Removing known insecure functions (such as the C runtime strcpy and strncpy functions). • Migrating weak cryptographic algo-rithms to more robust algorithms

Cited by 0

US Secure Hash Algorithm 1 (SHA1)

D. Eastlake, Paul B. Jones · 2001

Algorithm 1) hash algorithm conveniently available to the Internet community. The United States of America has adopted the SHA-1 hash algorithm described herein as a Federal Information Processing Standard. Most of the text herein was taken by the authors from FIPS 180-1. Only the C code implementation is "original".

Cited by 897Open access

An Improved Fast and Secure Hash Algorithm

Siddharth Agarwal, Abhinav Rungta, R. Padmavathy et al. · Journal of Information Processing Systems · 2012

Recently, a fast and secure hash function SFHA - 256 has been proposed and claimed as more secure and as having a better performance than the SHA - 256. In this paper an improved version of SFHA - 256 is proposed and analyzed using two parameters, namely the avalanche effect and uniform deviation. The experimental results and further analysis ensures the performance of the newly proposed and improved SFHA-256. From the analysis it can be concluded that the newly proposed algorithm is more secure, efficient, and practical.

Cited by 14

Secure Hash Algorithm-2 formed on DNA

Dieaa I. Nassr · Journal of the Egyptian Mathematical Society · 2019

Abstract We present a new version of the Secure Hash Algorithm-2 (SHA-2) formed on artificial sequences of deoxyribonucleic acid (DNA). This article is the first attempt to present the implementation of SHA-2 using DNA data processing. We called the new version DNSHA-2. We present new operations on an artificial DNA sequence, such as (1) $\bar {R}^{k}(\alpha)$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mover> <mml:mrow> <mml:mi>R</mml:mi> </mml:mrow> <mml:mo>̄</mml:mo> </mml:mover> </mml:mrow> <mml:mrow> <mml:mi>k</mml:mi> </mml:mrow> </mml:msup> <mml:mo>(</mml:mo> <mml:mi>α</mml:mi> <mml:mo>)</mml:mo> </mml:math> and $\bar {L}^{k}(\alpha)$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mover> <mml:mrow> <mml:mi>L</mml:mi> </mml:mrow> <mml:mo>̄</mml:mo> </mml:mover> </mml:mrow> <mml:mrow> <mml:mi>k</mml:mi> </mml:mrow> </mml:msup> <mml:mo>(</mml:mo> <mml:mi>α</mml:mi> <mml:mo>)</mml:mo> </mml:math> to mimic the right and left shift by k bits, respectively; (2) $\bar {S}^{k}(\alpha)$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mrow> <mml:mover> <mml:mrow> <mml:mi>S</mml:mi> </mml:mrow> <mml:mo>̄</mml:mo> </mml:mover> </mml:mrow> <mml:mrow> <mml:mi>k</mml:mi> </mml:mrow> </mml:msup> <mml:mo>(</mml:mo> <mml:mi>α</mml:mi> <mml:mo>)</mml:mo> </mml:math> to mimic the right rotation by k bits; and (3) DNA-nucleotide addition (mod 2 64 ) to mimic word-wise addition (mod 2 64 ). We also show, in particular, how to carry out the different steps of SHA-512 on an artificial DNA sequence. At the same time, the proposed nucleotide operations can be used to mimic any hash algorithm of its bitwise operations similar to bitwise operations specified in SHA-2. The proposed hash has the following features: (1) it can be applied to all data, such as text, video, and image; (2) it has the same security level of SHA-2; and (3) it can be performed in a biological environment or on DNA computers.

Cited by 8Open access

Secure Hash Algorithm-2 formed on DNA

Dieaa I. Nassr · Greater South Information System · 2019

Abstract We present a new version of the Secure Hash Algorithm-2 (SHA-2) formed on artificial sequences of deoxyribonucleic acid (DNA). This article is the first attempt to present the implementation of SHA-2 using DNA data processing. We called the new version DNSHA-2. We present new operations on an artificial DNA sequence, such as (1) $\bar {R}^{k}(\alpha)$ R ̄ k ( α ) and $\bar {L}^{k}(\alpha)$ L ̄ k ( α ) to mimic the right and left shift by k bits, respectively; (2) $\bar {S}^{k}(\alpha)$ S ̄ k ( α ) to mimic the right rotation by k bits; and (3) DNA-nucleotide addition (mod 2 64 ) to mimic word-wise addition (mod 2 64 ). We also show, in particular, how to carry out the different steps of SHA-512 on an artificial DNA sequence. At the same time, the proposed nucleotide operations can be used to mimic any hash algorithm of its bitwise operations similar to bitwise operations specified in SHA-2. The proposed hash has the following features: (1) it can be applied to all data, such as text, video, and image; (2) it has the same security level of SHA-2; and (3) it can be performed in a biological environment or on DNA computers.

Cited by 0Open access

NESHA-256, NEw 256-bit Secure Hash Algorithm

Yaser Esmaeili Salehani, S. Amir, Hossein A. E. Tabatabaei et al. · 2009

Abstract. In this paper, we introduce a new dedicated 256-bit hash function: NESHA-256. The recently contest for hash functions held by NIST, motivates us to design the new hash function which has a parallel structure. Advantages of parallel structures and also using some ideas from the designing procedure of block-cipher-based hash functions strengthen our proposed hash function both in security and in efficiency. NESHA-256 is designed not only to have higher security but also to be faster than SHA-256: the performance of NESHA-256 is at least 38 % better than that of SHA-256 in software. We give security proofs supporting our design, against existing known cryptographic attacks on hash functions.

Cited by 0

Entrodeduper: Data Deduplication Using Entropy and Secure Hash Algorithm

Tin Thein Thwel, Hsu Mon Maung · 2023

Being a data science era, any bulk of data concerned with specific fields need to maintain in data centers with the help of rack server. For reducing storage for data center, the need to implement the data deduplication mechanism and keeping backup of those data in data center is becoming more important. In the case of reducing redundant data from the various servers in data center, the huge amount of data become the biggest challenge. As the data deduplication mechanism not only it can reduce the size of data to be stored or to be transmit but also it can give the backup and recovery features. This paper proposed the efficient data deduplication mechanism called EntroDeduper, which is the hybrid of entropy, secure hash algorithm and indexing. The input files are divided into blocks using file separator and the redundant block is removed by applying the entropy gain theory, which is used to get not only the significant reduction rate but also the full block coverage for reconstruction.

Cited by 0

A SECURE APPROACH TO FINANCIAL DOCUMENT AUTHENTICATION USING SECURE HASH ALGORITHM – 256

Prasetya, Adityan Wisnu Yuda · Optimum: Journal of Economics and Development (University of Ahmad Dahlan Yogyakarta) · 2025

The advancement of technology is currently accelerating. Many financial transactions are now completed online in digital format. Financial statements, audits, and other important financial documents are stored and shared online. In this situation, financial record security is critical, particularly in preventing document alteration or forgery. Some examples of financial document breaches in 2022 include BI, PTC, PLN, JMTO, and others. Financial document authentication procedures must be implemented to ensure their integrity and validity. Coding is a subset of mathematics that is used in the workplace, such as the Secure Hash Algorithm - 256 (SHA-256). It has several advantages that are far superior to others. To improve the security and trustworthiness of electronic financial documents, this study will use the SHA-256 authentication algorithm to ensure that no financial data is leaked to parties who should not receive it.

Cited by 0Open access

Channel Aware Routing in MANET'S with Secure Hash Algorithm

P. Kiran Rao, S. Vasundra · 2012

A Mobile Ad-hoc Network (MANET) is a collection of autonomous nodes or terminals which communicate with each other by forming a multi-hop radio network and maintaining connectivity in a decentralized manner. Nodes in ad-hoc networks play both the roles of routers and terminals. Moreover, the routing path in ad-hoc networks is dynamic; it is not fixed as in wired networks. Therefore, some security mechanisms used in wired networks cannot simply be applied to protocols in ad-hoc networks. After analyzing various types of attacks against ad-hoc networks, a secure scheme for the famous routing protocol, CA- AOMDV (Channel Aware ad hoc multipath distance vector routing) is proposed. To guarantee the integrity in ad-hoc networks, Secure Hash Algorithm-1 (SHA-1) is used. Furthermore, NS2 (Network Simulator) software is used to simulate this scheme and performance analysis are made.

Cited by 3

On Information Integrity Measurement with Secure Hash Algorithm (SHA)

Segun Adebisi Ojo, Aderonke Favour-Bethy Thompson, Mary O Iyare et al. · Informing Science and IT Education Conference · 2015

The “information age” as often referred to the modern society, has become heavily dependent on information systems. As this dependency increases, the threat to information security has also gained ground. Societies need to cater for the security of information, and this has led to the development of different information security techniques most notable of which is cryptography. Cryptographic Hash functions are used to achieve a number of security goals like authenticity, digital signatures, pseudo-random number generation, digital steganography, digital time stamping. The strength of a cryptographic hash function can be summarized into its vulnerability to attack and computational time. This work therefore, reviews existing standard cryptographic hash functions, their construction and their application areas. The secured hash function (SHA) was selected and implemented based on its comparative worth over others. The implemented cryptographic hash function is evaluated for performance using a cryptographic evaluation standard.

Cited by 0Open access