You must have Credits on your Balance to download this sample

# Hash Algorithm and Secure Hash Algorithm

Masters

Essay

Technology

Pages 12 (3012 words)

Download 0

A hash function is a reproducible method of turning some kind of data into a (relatively) small number that may serve as a digital "fingerprint" of the data. The algorithm "chops and mixes" (i.e., substitutes or transposes) the data to create such fingerprints…

Get more done in less time

Let us write a custom essay on your topic

“Hash Algorithm and Secure Hash Algorithm” with a personal 15% discount.

Order now
## Introduction

"Hash functions are designed to be fast and to yield few hash collisions in expected input domains. In hash tables and data processing, collisions inhibit the distinguishing of data, making records more costly to find.

A fundamental property of all hash functions is that if two hashes (according to the same function) are different, then the two inputs are different in some way. This property is a consequence of hash functions being deterministic. On the other hand, a function is not injective, i.e., the equality of two hash values ideally strongly suggests, but does not guarantee, the equality of the two inputs. If a hash value is calculated for a piece of data, and then one bit of that data is changed, a hash function with a strong mixing property usually produces a completely different hash value.

Typical hash functions have an infinite domain, such as byte strings of arbitrary length, and a finite range, such as bit sequences of some fixed length. In certain cases, hash functions can be designed with one-to-one mapping between identically sized domain and range. Hash functions that are one-to-one are also called permutations. Reversibility is achieved by using a series of reversible "mixing" operations on the function input."2

""Because of the variety of applications for hash functions (details below), they are often tailored to the application. ...

Download paper
Not exactly what you need?

### Related papers

Global Environment for Network Innovation By NSF
It is a revolution in network based systems. NSF is the immediate funding for community prototyping and experiments. Through this system researchers will be able to build their own new versions of the "net" or to study the "net" in ways that are probably impossible in the present day. It is also important to note that compatibility, with the Internet is not necessary. The principle of GENI is to…

The Security Risks to Online Banking
Though, the Internet has made it possible for businesses to carry out their activities in a more efficient and cost-effective manner but at the same time, it has proved to be more insecure than traditional ways of trade because practically, it is much more difficult and expensive to tackle fraudulent activities that cyber-criminals and hackers carry out aggressively to steal confidential;…

Temporally-Ordered Routing Algorithm
The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals. The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks. In these networks, the protocol's reaction to link failures typically involves only a localized "single pass" of…

Computer Network Security Methods
The boom in information technology has revolutionized communications world wide. The exponential growth of the most popular public network, Internet, has made inter-communication fast and effective. The amount of data flow through e-mails, e-commerce etc has gained new peaks and is still growing. Business transactions on corporate networks, corporate data access facilities for mobile employees,…

Cryptosystems Based on Discrete Logarithm
Rather it will be sent as the binary string corresponding to another number which depends on the number 161 according to some fixed rule. For example we can subtract 161 from the largest 3-digit number 999 and send the result 838. Thus the rule for encryption is:…

Information Theory and Cryptography
In the present context, with the advent of computers in every aspect of daily routines of individuals and organizations in the 21st century, large amounts of information have to stored in or transmitted through unsafe media. It becomes essential that such information is not accessible to those who are not privy to it. Thus, to this effect of lending exclusivity to information stored or…

Hash Algorithm and Secure Hash Algorithm
"Hash functions are designed to be fast and to yield few hash collisions in expected input domains. In hash tables and data processing, collisions inhibit the distinguishing of data, making records more costly to find.…