Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 31 views

    Week 6

    Uploaded by

    Hala Gharib
    This document discusses cryptographic data integrity algorithms and hash functions. It explains that hash functions compress an input of arbitrary length into a fixed-length output called a message digest. Popular hash functions mentioned include MD, SHA, and RIPEMD. Hash functions have two main applications - password storage and data integrity checking. The document also provides a simple example of how a basic hash function works by XORing each block of an input.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Week 6

    Uploaded by

    Hala Gharib
    31 views7 pages
    This document discusses cryptographic data integrity algorithms and hash functions. It explains that hash functions compress an input of arbitrary length into a fixed-length output called a message digest. Popular hash functions mentioned include MD, SHA, and RIPEMD. Hash functions have two main applications - password storage and data integrity checking. The document also provides a simple example of how a basic hash function works by XORing each block of an input.

    Original Title

    Week-6.pptx

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses cryptographic data integrity algorithms and hash functions. It explains that hash functions compress an input of arbitrary length into a fixed-length output called a message digest. Popular hash functions mentioned include MD, SHA, and RIPEMD. Hash functions have two main applications - password storage and data integrity checking. The document also provides a simple example of how a basic hash function works by XORing each block of an input.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    31 views7 pages

    Week 6

    Uploaded by

    Hala Gharib
    This document discusses cryptographic data integrity algorithms and hash functions. It explains that hash functions compress an input of arbitrary length into a fixed-length output called a message digest. Popular hash functions mentioned include MD, SHA, and RIPEMD. Hash functions have two main applications - password storage and data integrity checking. The document also provides a simple example of how a basic hash function works by XORing each block of an input.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 7

    Week-6

    CRYPTOGRAPHIC DATA INTEGRITY


    ALGORITHMS
    Cryptography 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.
    The following picture illustrated hash function −
    Popular Hash Functions
    • Message Digest (MD)
    • Secure Hash Function (SHA)
    • RIPEMD(RACE Integrity Primitives Evaluation Message
    Digest)
    • Whirlpool
    Applications of Hash Functions
    There are two direct applications of hash function based on its
    cryptographic properties.
    • Password Storage
    • Data Integrity Check
    TWO SIMPLE HASH FUNCTIONS
    • All hash functions operate using the following general principles.
    • The input (message, file, etc.) is viewed as a sequence of n-bit
    blocks. The input is processed one block at a
    time in an iterative fashion to produce an n-bit hash function.
    • One of the simplest hash functions is the bit-by-bit exclusive-OR
    (XOR) of every block.
    This can be expressed as

    You might also like