Scribd
Upload
122 views

Cryptographic Hash Functions

Cryptographic hash functions are mathematical functions that compress an input of arbitrary length into a fixed-length output. They have several key properties: (1) they produce outputs (hashes) of fixed length, (2) they are efficient to compute, (3) it is hard to reverse them to find the input, and (4) it is hard to find two inputs that produce the same output (collision resistance). Hash functions have many applications including message authentication codes (MACs), digital signatures, and data integrity checks. MACs use a secret key along with a message to generate a hash-based code to authenticate the message, while digital signatures use public/private key cryptography to bind a sender to a message through a hash of

Uploaded by

Urvil Sitapare
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
122 views

Cryptographic Hash Functions

Cryptographic hash functions are mathematical functions that compress an input of arbitrary length into a fixed-length output. They have several key properties: (1) they produce outputs (hashes) of fixed length, (2) they are efficient to compute, (3) it is hard to reverse them to find the input, and (4) it is hard to find two inputs that produce the same output (collision resistance). Hash functions have many applications including message authentication codes (MACs), digital signatures, and data integrity checks. MACs use a secret key along with a message to generate a hash-based code to authenticate the message, while digital signatures use public/private key cryptography to bind a sender to a message through a hash of

Uploaded by

Urvil Sitapare
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

Cryptography & Network

Security (SEIT3062)
What are Cryptographic hash functions?
 Hash functions are extremely useful and appear in almost
all information security applications.
 A hash function is a mathematical function that converts
a numerical input value into another compressed
numerical value. The input to the hash function is of
arbitrary length but output is always of fixed length.
 Values returned by a hash function are called message
digest or simply hash values.
 Hash value(h) = H(M) ;
o M = message, H() = Hash function
The following picture is illustrated hash
function:
Features of Hash Functions
 Fixed Length Output (Hash Value)
◦ Hash function coverts data of arbitrary length to a fixed length. This
process is often referred to as hashing the data.
◦ In general, 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.
◦ Hash function with n bit output is referred to as an n-bit hash function.
Popular hash functions generate values between 160 and 512 bits.
 Efficiency of Operation
◦ Generally for any hash function h with input x, computation of h(x) is a
fast operation.
◦ Computationally hash functions are much faster than a symmetric
encryption.
Properties of Hash Functions
 Pre-Image Resistance
 This property means that it should be computationally hard to reverse a
hash function.
 In other words, 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.

 Collision Resistance
 This property means it should be hard to find two different inputs of any
length that result in the same hash. This property is also referred to as
collision free hash function.
 In other words, for a hash function h, it is hard to find any two different
inputs x and y such that h(x) = h(y).
Popular and Applications of Hash functions

RIPEMD

Secure Hash
Message
Function
Authentication
(SHA)

Message Digital
Digest (MD) Signature

Whirlpool Data Integrity


Check
Message Authentication
1) Verify the integrity of a message
◦ Ensure data received are exactly as sent
◦ Assure identity of the sender is valid

2) Hash function used to provide message authentication is


called message digest

 MAC algorithm is a symmetric key cryptographic technique to provide


message authentication. For establishing MAC process, the sender and
receiver share a symmetric key K.
 Essentially, a MAC is an encrypted checksum generated on the underlying
message that is sent along with a message to ensure message
authentication.
Model of Message Authentication
Process of Message Authentication
 The sender uses some publicly known MAC algorithm, inputs the message
and the secret key K and produces a MAC value.
 Similar to hash, MAC function also compresses an arbitrary long input
into a fixed length output. The major difference between hash and MAC is
that MAC uses secret key during the compression.
 The sender forwards the message along with the MAC. Here, we assume
that the message is sent in the clear, as we are concerned of providing
message origin authentication, not confidentiality. If confidentiality is
required then the message needs encryption.
 On receipt of the message and the MAC, the receiver feeds the received
message and the shared secret key K into the MAC algorithm and re-
computes the MAC value.
Process of Message Authentication
 The receiver now checks equality of freshly computed MAC with the
MAC received from the sender. If they match, then the receiver accepts the
message and assures himself that the message has been sent by the
intended sender.
 If the computed MAC does not match the MAC sent by the sender, the
receiver cannot determine whether it is the message that has been altered
or it is the origin that has been falsified. As a bottom-line, a receiver safely
assumes that the message is not the genuine.
Digital Signatures
 Digital signatures are the public-key primitives of message authentication.
In the physical world, it is common to use handwritten signatures on
handwritten or typed messages. They are used to bind signatory to the
message.
 Similarly, a digital signature is a technique that binds a person/entity to the
digital data. This binding can be independently verified by receiver as well
as any third party.
 Digital signature is a cryptographic value that is calculated from the data
and a secret key known only by the signer.
 In real world, the receiver of message needs assurance that the message
belongs to the sender and he should not be able to repudiate the origination
of that message. This requirement is very crucial in business applications,
since likelihood of a dispute over exchanged data is very high.
Model of Digital Signature
Process of Digital Signatures
 Each person adopting this scheme has a public-private key pair.
 Generally, the key pairs used for encryption/decryption and
signing/verifying are different. The private key used for signing is referred
to as the signature key and the public key as the verification key.
 Signer feeds data to the hash function and generates hash of data.
 Hash value and signature key are then fed to the signature algorithm which
produces the digital signature on given hash. Signature is appended to the
data and then both are sent to the verifier.
 Verifier feeds the digital signature and the verification key into the
verification algorithm. The verification algorithm gives some value as
output.
Process of Digital Signatures
 Verifier also runs same hash function on received data to generate hash
value.
 For verification, this hash value and output of verification algorithm are
compared. Based on the comparison result, verifier decides whether the
digital signature is valid.
 Since digital signature is created by ‘private’ key of signer and no one else
can have this key; the signer cannot repudiate signing the data in future.
Advantages and Disadvantages
 Cryptographic hashes take clear text passwords and turn them into
enciphered text for storage. Attackers who access your database are forced
to decipher those hash values if they want to exploit them. In other words,
hashes slow down attackers.

 Attackers equipped with fast hardware can easily “crack” hashed


credentials.
 Good hash algorithms are designed to be collision-resistant, but collisions
are impossible to eliminate completely. MD5 and SHA-1 have been proven
to contain known collisions—that is, produce the same hash value from
different credentials.
THANK YOU!!!!

You might also like