Hashing Algorithm

Presented By Ilkesh Mavani

Outline
 Introduction
 Hashing Algorithm
 Qualities of a good hash function
 Digital Signature
 Cryptographic hash function
 Hash table
 Method of hash function
 The division-remainder
method:
 Folding:
 Radix transformation:
 Digit rearrangement
 Application Hash Function
 Error correction and detection
 Identification and verification
 Audio identification

 Reference
Introduction
 Origins of the term

 What is hashing?

 Main Use:
 Database
 Security Algorithm
Hashing algorithm
 A hash is a mathematical function that takes in some
arbitrary value and produces a hash value, based on the
given input.
 The hashing algorithm is called the hash function .In
addition to faster data retrieval, hashing is also used to
encrypt and decrypt digital signatures.

HORSE
Hash GHETSB
Function
Qualities of a good hash function

 Produces a fixed length key for variable input

 Has got infinite key space, implies the next point

 No collisions (i.e. no two different pieces of input give

the same key value)
Digital Signature
 The digital signature is transformed with the hash function
and then both the hashed value and the signature are sent
in separate transmissions to the receiver.

 Using the same hash function as the sender, the receiver

derives a message-digest from the signature and compares it
with the message-digest it also received. They should be the
same.
 Authentication : proof of identity of the parties to an
electronic transaction;
 Integrity: assurance that the contents of a message
have not been tampered with or modified;
 Non-repudiation: proof of agreement to the terms of the
transaction and prevention of denial of commitment
Digital signature creation and verification

 Digital signature creation

Digital signature verification
Cryptographic Hash function
 In cryptography, a cryptographic hash function
is a hash function with certain additional
security properties to make it suitable for use as
a primitive in various information security
applications, such as authentication and
message integrity.

 A hash function takes a long string of any

length as input and produces a fixed length
string as output, sometimes termed a maessage
digest.
 Hash Table

Hash tables, a major application for hash functions, enable

fast lookup of a data record given its key.

 hash table, or a hash map,

means a data structure
that associates keys with
values.
 Method in hash Function
 The division-remainder method:
 Folding:
 Radix transformation:
 Digit rearrangement:
Application hash function

 Error correction and detection

 Identification and verification

 Audio identification
Reference
 www.wikipedia.org

 http://ieeexplore.ieee.org

 http://www.google.com
Thank You