Scribd
Upload
42 views5 pages

Hash Function: Revanth M (MY - SC.U3BCA16087)

A hash function converts an input of arbitrary length into a fixed-length output called a hash value or message digest. It is generated by a hash function H that takes a message M as input. Hash functions are easy to compute and make it infeasible to determine the input given the output or find collisions between inputs. They are commonly used to securely store passwords, detect changes to messages, and create digital signatures.

Uploaded by

revanth
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
42 views5 pages

Hash Function: Revanth M (MY - SC.U3BCA16087)

A hash function converts an input of arbitrary length into a fixed-length output called a hash value or message digest. It is generated by a hash function H that takes a message M as input. Hash functions are easy to compute and make it infeasible to determine the input given the output or find collisions between inputs. They are commonly used to securely store passwords, detect changes to messages, and create digital signatures.

Uploaded by

revanth
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 5

HASH FUNCTION

Done by:-
Revanth M [MY.SC.U3BCA16087]
Hash Function
• 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.
• A hash function h is generated by a function H of the form:
h = H(M)
• Since a hash is a smaller representation of a larger data, it is also
referred to as a digest.
Working Hash Function
Requirements for Hash Functions
1.can be applied to any size message M
2.produces a fixed-length output h
3.is easy to compute h=H(M) for any message M
4.given h is infeasible to find x s.t. H(x)=h
• one-way property
5.given x is infeasible to find y s.t. H(y)=H(x)
• weak collision resistance
6.is infeasible to find any x,y s.t. H(y)=H(x)
• strong collision resistance
Applications of Hash Function
• To create a one-way password file
i.e, Store hash of password not actual password.
• Hash used to detect changes to message.
• Most often to create a digital signature.
• Password verification

You might also like