Nobody downloaded yet

Hash Algorithm and Secure Hash Algorithm - Essay Example

Comments (0) Cite this document
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…
Download full paperFile format: .doc, available for editing
GRAB THE BEST PAPER97.1% of users find it useful
Hash Algorithm and Secure Hash Algorithm
Read TextPreview

Extract of sample
"Hash Algorithm and Secure Hash Algorithm"

Download file to see previous pages "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. For example, cryptographic hash functions assume the existence of an adversary who can deliberately try to find inputs with the same hash value. A well designed cryptographic hash function is a "one-way" operation: there is no practical way to calculate a particular data input that will result in a desired hash value, so it is also very difficult to forge. Functions intended for cryptographic hashing, such as MD5, are commonly used as stock hash functions.
Functions for error detection and correction focus on distinguishing cases in which data has been disturbed by random processes. When hash functions are used for checksums, the relatively small hash value can be used to verify that a data file of any size has not been altered.""3
""Hash tables, a major application for hash functions, enable fast lookup of a data record given its key. (Note: Keys are not usually secret as in cryptography, but both are used to "unlock" or access information.) For example, keys in an English dictionary would be English words, and their associated records would contain definitions. In this case, the hash function must map alphabetic strings to indexes for the hash table's internal array.
The ideal for a hash table's hash function is to map each key to a unique index (see perfect hashing), because this guarantees access to each data record in the first probe into the table. However, this is often impossible or impractical.
Hash functions that are truly random with uniform output (including most cryptographic hash functions) are good in that, on average, only one or two probes will be needed (depending on the load factor). Perhaps as important is that excessive collision rates with random hash functions are highly improbable-if not computationally infeasible for an adversary. However, a small, predictable number of collisions is virtually inevitable (see birthday paradox).
In many cases, a heuristic hash function can yield many fewer collisions than a random hash funct ...Download file to see next pagesRead More
Cite this document
  • APA
  • MLA
(“Hash Algorithm and Secure Hash Algorithm Essay Example | Topics and Well Written Essays - 3000 words”, n.d.)
Hash Algorithm and Secure Hash Algorithm Essay Example | Topics and Well Written Essays - 3000 words. Retrieved from https://studentshare.org/technology/1533762-hash-algorithm-and-secure-hash-algorithm
(Hash Algorithm and Secure Hash Algorithm Essay Example | Topics and Well Written Essays - 3000 Words)
Hash Algorithm and Secure Hash Algorithm Essay Example | Topics and Well Written Essays - 3000 Words. https://studentshare.org/technology/1533762-hash-algorithm-and-secure-hash-algorithm.
“Hash Algorithm and Secure Hash Algorithm Essay Example | Topics and Well Written Essays - 3000 Words”, n.d. https://studentshare.org/technology/1533762-hash-algorithm-and-secure-hash-algorithm.
  • Cited: 0 times
Comments (0)
Click to create a comment or rate a document
Hardware Security Module - Optimization
current HSMSs capabilities will be mentioned and a comprehensive analysis of the same will be used to show the performance gap between what HSMs are able to do and what they require to work. This will be illustrated using a case study which will focus to show the new security
18 Pages(4500 words)Essay
Critical Chain Project Management Based Heuristics Algorithm
El Goldratt (Hong and Ji-hai 330). The paper is divided into six parts which contain different sub-sections that explain the Critical Chain Project Management Based Heuristic Algorithm for Multiple Resources-Constrained Project, a conclusion, and
2 Pages(500 words)Essay
Adaptive Portfolio Management using Evolutionary Algorithm
Adaptive Portfolio Management using Evolutionary Algorithm A Dissertation Proposal* Farhad Bahramy 31. July.2011 Table of Contents 1.Introduction: 3 2.Motivation: 4 3.Problem Definition: 4 4.Relevant Literature: 6 5.Proposed Approach: 8 I.Market Trends 8 II.Execution rules 9 III.Risk management rules 10 IV.Representation: 10 V.Evolutionary Process: 12 VI.Evaluation of the strategies: 15 VII.Execution of adapting the strategies: 16 VIII.Performance measurement: 17 6.Question to Be Answered 17 7.Expected Contribution 17 8.Work Plan: 18 9.References: 18 1.
9 Pages(2250 words)Essay
Network and Internet Security
It is also eliminated when the session is over. Session keys are characteristically symmetrical and uncomplicated as concerns cryptography. This plainness would normally be a chief disadvantage of applying the key. However since several keys are utilized instantly and the keys aren’t utilized for long, it does not create much crisis (Carver, 2007).
4 Pages(1000 words)Essay
Forensic computing
It is known to be one of the most powerful and fastest tools in searching or locating files. OS forensics does not miss or omit files during the search operation, a weakness associated by the default search tool that comes with Windows systems. Its fastness does not affect the results so the user can be well assured that OS forensics will locate every single file on the hard disk.
5 Pages(1250 words)Essay
Blowfish Encryption Algorithm
As information technology is now considered as the fundamental function, every organization acquires information systems for business automation. Moreover, electronic commerce has also introduced many businesses that are only virtually present. For instance, Amazon that is an online store for selling books generates revenue from the Internet.
8 Pages(2000 words)Essay
Pollard Rho Algorithm
The most significant application of this algorithm is with Discrete Logarithmic Problem (DLP). It is a probabilistic algorithm which works by sequential iterations of a random quadratic function. Random coefficients are selected for a standard quadratic function which generates numbers, which are reduced modulo the composite number.
3 Pages(750 words)Essay
Digital signatures
Additionally, they carry out most of the business activities on the internet, this process is acknowledged as electronic commerce (e-commerce). In addition, e-commerce offers a lot of benefits to the
22 Pages(5500 words)Essay
Temporally-Ordered Routing Algorithm
Park has patented his work, and owns Nova Engineering, who are marketing a wireless router product based on Parks algorithm. (Wikipedia, 2005, para.1-2) Park and Corson (1997, p.1) name the TORA protocol as one of a family of protocols which they term "link reversal" algorithms.
13 Pages(3250 words)Essay
Network security
This process is achieved using encryption algorithms that are used to generate keys for encrypting and decrypting data. Technical security controls are used to provide control mechanisms within systems to as to mitigate potential security
2 Pages(500 words)Essay
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.
Let us find you another Essay on topic Hash Algorithm and Secure Hash Algorithm for FREE!
logo footer
Contact us:
Contact Us Now
FREE Mobile Apps:
  • StudentShare App Store
  • StudentShare Google play
  • About StudentShare
  • Testimonials
  • FAQ
  • Blog
  • Free Essays
  • New Essays
  • Essays
  • Miscellaneous
  • The Newest Essay Topics
  • Index samples by all dates
Join us:
Contact Us