![Hash Functions
A hash function, is a function that takes some message of any length as input and
transforms it into a fixed-length output called a hash value, a message digest, a
checksum. [1]
[2]](https://image.slidesharecdn.com/securehashfunction-180717102407/85/Secure-hash-function-4-320.jpg)
![Applications of Hash Functions (cont…)
The process of logon is depicted in the following illustration,
An intruder can only see the hashes of passwords, even if he accessed the
password. He can neither logon using hash nor can he derive the password from
hash value since hash function possesses the property of pre-image resistance.
[3]](https://image.slidesharecdn.com/securehashfunction-180717102407/85/Secure-hash-function-8-320.jpg)
![References.
[1] CRYPTOGRAPHIC HASH FUNCTION by Bart Preneel NFWO postdoctoral
researcher, sponsored by the National Fund for Scientific Research (Belgium)
[2][3]
https://www.tutorialspoint.com/cryptography/cryptography_hash_functions.htm](https://image.slidesharecdn.com/securehashfunction-180717102407/85/Secure-hash-function-11-320.jpg)
Secure hash function
- 1. Secure Hash Function By Mohibullah Sail Section “A” 6th semester BS-SE Sarhad University Peshawar
- 2. Agenda Basic Concepts Introduction Features Different Hash Functions Applications of Hash Function Challenges of Hash Function References
- 3. Basic concepts Hashing Encryption Decryption Encoding Cryptography
- 4. Hash Functions A hash function, is a function that takes some message of any length as input and transforms it into a fixed-length output called a hash value, a message digest, a checksum. [1] [2]
- 5. Features of Hash Functions Hash function coverts data of arbitrary length to a fixed length. The hash is much smaller than the input data, hence hash functions are sometimes called compression functions. Since a hash is a smaller representation of a larger data, it is also referred to as a digest. Generally for any hash function h with input x, computation of h(x) is a fast operation. Computationally it is very hard to reverse a hash function. Given an input and its hash, it should be hard to find a different input with the same hash
- 6. Different Hash Functions Message Digest(MD). Secure Hash Function (SHA). RIPEMD Whirlpool
- 7. Applications of Hash Functions The two direct applications of Hash Functions are Password Storage: Hash functions provide protection to password storage. Instead of storing password in clear, mostly all logon processes store the hash values of passwords in the file. The Password file consists of a table of pairs which are in the form (user id, h(P)).
- 8. Applications of Hash Functions (cont…) The process of logon is depicted in the following illustration, An intruder can only see the hashes of passwords, even if he accessed the password. He can neither logon using hash nor can he derive the password from hash value since hash function possesses the property of pre-image resistance. [3]
- 9. Applications of Hash Functions (cont…) Data integrity check: Data integrity check is a most common application of the hash functions. It is used to generate the checksums on data files. This application provides assurance to the user about correctness of the data. The process is depicted in the following illustration −
- 10. Challenges of Hashing Functions Simple hashing is inscure for storing passwords. The randomness issue
- 11. References. [1] CRYPTOGRAPHIC HASH FUNCTION by Bart Preneel NFWO postdoctoral researcher, sponsored by the National Fund for Scientific Research (Belgium) [2][3] https://www.tutorialspoint.com/cryptography/cryptography_hash_functions.htm
Editor's Notes
- #4: Before jumping into the hashing functions first we need to understand some of the the basic concepts related to this topic… Hashing ,in cryptography, is a one-way operation which transforms a stream of data into a more compressed form called a message digest. The operation is not be invertible, meaning that recovering the original data stream from the message digest should not be possible. All the message digests or hash values generated by a given hash function have the same size no matter what the size of the input value is. Encryption is the process by which one changes a message (called plaintext) in order to render it unreadable to all but those possessing the decryption key. The unreadable message is usually referred to as the ciphertext. Decryption: Decryption is the inverse process which recovers the plaintext from the ciphertext Encoding: is sometimes used and accepted as a synonym for encryption, is more directed at converting some data to a format that will facilitate its efficient manipulation, transmission and storage in the digital world. Encoding does not conceal the content of data; it only converts the data to a format that can be efficiently managed by our electronic devices (computer, mobile phone, television etc), transmission media (cables and wires), storage devices (hard disk, pen drive), and applications software (web browser, mail client etc). Cryptography is the science that aims at designing and developing cryptographic systems, sometimes referred to as a cryptosystems.and A cryptosystem is a set of methods needed to create a particular encryption and decryption scheme.
- #6: Point no 5: if a hash function h produced a hash value z, then it should be a difficult process to find any input value x that hashes to z. This property protects against an attacker who only has a hash value and is trying to find the input. Point no 6: if a hash function h for an input x produces hash value h(x), then it should be difficult to find any other input value y such that h(y) = h(x). This property of hash function protects against an attacker who has an input value and its hash, and wants to substitute different value as legitimate value in place of original input value.
- #7: MD5 was most popular and widely used hash function for quite some years. The MD family comprises of hash functions MD2, MD4, MD5 and MD6. It was adopted as Internet Standard RFC 1321. It is a 128-bit hash function. MD5 digests have been widely used in the software world to provide assurance about integrity of transferred file. For example, file servers often provide a pre-computed MD5 checksum for the files, so that a user can compare the checksum of the downloaded file to it. In 2004, collisions were found in MD5. An analytical attack was reported to be successful only in an hour by using computer cluster. This collision attack resulted in compromised MD5 and hence it is no longer recommended for use. Secure Hash Functions(SHA)…. Family of SHA comprise of four SHA algorithms; SHA-0, SHA-1, SHA-2, and SHA-3. Though from same family, there are structurally different. The original version is SHA-0, a 160-bit hash function, was published by the National Institute of Standards and Technology (NIST) in 1993. It had few weaknesses and did not become very popular. Later in 1995, SHA-1 was designed to correct alleged weaknesses of SHA-0. RIPEND: The RIPEND is an acronym for RACE Integrity Primitives Evaluation Message Digest. This set of hash functions was designed by open research community and generally known as a family of European hash functions. The set includes RIPEND, RIPEMD-128, and RIPEMD-160. There also exist 256, and 320-bit versions of this algorithm. Whirpool: This is a 512-bit hash function. It is derived from the modified version of Advanced Encryption Standard (AES). One of the designer was Vincent Rijmen, a co-creator of the AES. Three versions of Whirlpool have been released; namely WHIRLPOOL-0, WHIRLPOOL-T, and WHIRLPOOL.
- #9: Pre-image resistance: This property means given an input and its hash, it should be hard to find a different input with the same hash.
- #10: The biggest example of data integrity check is linux operating system…….when u download a linux operating system u must verify it using this same hash function …it tells us that whether the file we are downloading is not altered, modified……..and is free from virus.
- #11: Point no 1: The fact that the output of a hash function cannot be reverted back to the input using an efficient algorithm does not mean that it cannot be cracked. Databases containing hashes of common words and short strings are usually within our reach with a simple google search. Also, common strings can be easily and quickly brute-forced or cracked with a dictionary attack. Point no 2: When a random number is requested to the computer, it typically gets inputs from several sources, like environment variables (date, time, # of bytes read/written, uptime…), then apply some calculations on them to produce random data. This is the reason why random data given by an algorithm is called pseudo random and thus it is important to differentiate from a true random data source. If we are somehow able to recreate the exact conditions present at the moment of the execution of a pseudo-random number generator (or PRNG), we will automatically have the original generated number. Additionally, if a PRNG is not properly implemented, it is possible to discover patterns in the generated data. In cryptography, a salt is random data that is used as an additional input to a one-way function that "hashes" data, a password or passphrase. ... The primary function of salts is to defend against dictionary attacks or against its hashed equivalent, a pre-computed rainbow table attack.