Scribd
Upload
46 views1 page

Hash

Hashing with block ciphers takes a variable length input message and produces a fixed length output hash value or message digest. The hash value acts as a fingerprint that uniquely identifies the original message. Any changes to the message will result in a different hash value, allowing one to detect if a message has been altered or forged. For example, changing a single space in a sample message produced a completely different 160-bit SHA-1 hash value. Hashing ensures the integrity of data transmitted or stored.

Uploaded by

sahilrocks001
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
46 views1 page

Hash

Hashing with block ciphers takes a variable length input message and produces a fixed length output hash value or message digest. The hash value acts as a fingerprint that uniquely identifies the original message. Any changes to the message will result in a different hash value, allowing one to detect if a message has been altered or forged. For example, changing a single space in a sample message produced a completely different 160-bit SHA-1 hash value. Hashing ensures the integrity of data transmitted or stored.

Uploaded by

sahilrocks001
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

HASHING WITH BLOCK CIPHERS

A hash function takes a variable would cause its message digest to


sized input message andproduces not match with its original
a fixed-sized output. The output message
isusually referred to as the hash digest. This can be used to check
code or the hash value or the for forgeries, unauthorized
message digest. For example, the alterations, etc. To see the
SHA-512 hash function takes for change in the hash code
input messagesof length up to produced by
2128 bits and produces as output the most innocuous of changes in
a 512-bitmessage digest (MD). the input message:
(SHA stands for Secure Hash Input message: "A hungry brown
Algorithm. fox jumped over a lazy dog"
[Note: A series of SHA SHA1 hash code:
algorithms has been developed a8e7038cf5042232ce4a2f582640
by f2aa5caf12d2
the National Institute of Input message: "A hungry brown
Standards and Technology and fox jumped over a lazy dog"
published as SHA1 hash code:
Federal Information Processing d617ba80a8bc883c1c3870af12a5
Standards (FIPS).] 16c4a30f8fda
• We can think of the hash code The only difference between the
as a fixed-sized fingerprint of two messages is the extra space
a variable-sized message. between the words “hungry” and
• Message digests produced by “brown” in the second message.
the most commonly used hash Notice how completely different
functions the hash code looks. SHA-1
range in length from 160 to 512 produces
bits depending on the algorithm a 160 bit hash code. It takes 40
used. hex characters to show the
2 code in hex.
• Since a message digest depends
on all the bits in the input
message,
any alteration of the input
message during transmission

You might also like