Cryptographic hash function md5

May 25, 2017Download as pptx, pdf5 likes2,371 views

This document discusses the MD5 cryptographic hash function. It provides an introduction to hash functions and describes MD5, including its features, applications, algorithm, analysis, and drawbacks. MD5 produces a 128-bit hash value from a message of any size through a multi-step process involving padding, appending a length, initializing buffers, and processing in 16-word blocks. While once widely used, MD5 is now considered broken due to vulnerabilities found in its compression function and preimage resistance.

Cryptographic Hash Function: MD5
1
1
Md. Shahidul Islam
CSE, KU
shahid.sm35@gmail.com

Outline
 Introduction
Features
Application
Algorithm
Hash analysis
Drawbacks
2
2

Introduction
 A cryptographic hash function is a kind of algorithm
that can be run on a piece of data, like an individual
file or a password, producing a value called a
checksum.
 MD5 (Message-Digest algorithm 5) is a widely used
cryptographic hash function designed by Ronald L.
Rivest in 1991.
 It is one in a series of message digest algorithms.
3
3

Features of a hash function
 Fixed Length Output (Hash Value)
 Efficiency in computing
 Collision Resistance, two different message should not have
the same hash value
 Deterministic so the same message always results in the same
hash
 Infeasible to generate a message from its hash value except
by trying all possible messages
4
4

Application
 There are two types of application of hash function:
1. Password Storage
2. Data Integrity Check
5
5

Application (Cont.)
 MD5 is used to store hash passwords and verify
when user login.
 An intruder can only see the hashes of passwords,
even if he accessed the password.
6
6

Application (Cont.)
 The integrity check helps the user to detect any
changes made to original file.
8
8

Algorithm
9
9
Step 1: Append padded bits:
• The message is padded so that, length mod 512 = 448
• A single “1” bit is appended to the message, and then “0” bits are
appended so that the length in bits equals 448 modulo 512.
Message 1 0 0 0 0 0
(Message length + padded bits) % 512 = 448

Algorithm (Cont.)
10
10
Step 2: Append length:
• A 64 bit integer representation of message is appended to the result of
the previous step.
• The resulting message has a length that is an exact multiple of 512
bits.
Message 1 0 0 0 0 0 64bits
(Message length + padded bits + 64 bits ) % 512 = 0

Algorithm (Cont.)
11
Step 3: Initialize MD Buffer:
• A four-word buffer (A,B,C,D) is used to compute the message digest.
• These are initialized to the
following values in hexadecimal:
A: 01 23 45 67
B: 89 ab cd ef
C: fe dc ba 98
D: 76 54 32 10

Algorithm (Cont.)
12
Step 4: Process message in 16-word blocks:
• Four auxiliary functions that take as input three 32-bit
words and produce as output one 32-bit word.
F(X, Y, Z) = (X ˄ Y) ˅ (¬ X ˄ Z)
G(X, Y, Z) = (X ˄ Z) ˅ (Y ˄ ¬ Z)
H(X, Y, Z) = X  Y  Z
I(X, Y, Z) = Y  (X ˅ ¬Z)

Algorithm (Cont.)
13
Step 5: Output:
• The message digest produced as output is A, B, C, D.
• That is, output begins with the low-order byte of A,
and end with the high-order byte of D.
A1 A2 . . . . . . . . . . . . . . . . . . . . D3
128 bits = 32 hexadecimal digits
A1, A2 are bytes

Hash analysis
14
• A small change in original message and the output
digest is completely different

Hash analysis (Cont.)
15
• Arbitrary message length to fixed length digest
• For MD5 128 bits = 32bits hexadecimal

Drawbacks
 In 1993 a hash collision was found in MD5 compression
function.
 In 2009 a preimage attack against MD5 was published that
breaks MD5’s preimage resistance.
 In 2012, the most infamous attack happened by the Flame
Malware. The CMU Software Engineering Institute considers
MD5 "cryptographically broken and unsuitable for further
use".
16
16

Drawbacks (Cont.)
 For cracking password crackers use rainbow table
 Salting process can make rainbow table ineffective
17
17

The document discusses the MD5 algorithm used for generating message digests of arbitrary inputs. It describes the MD5 algorithm structure and implementation steps. The implementation involves padding the input message to a length congruent to 448 modulo 512 bits. A 64-bit representation of the original message length is then appended. The padded message is processed in 512-bit blocks, each divided into sixteen 32-bit words. Four initialization values are used to compute the message digest through four rounds of operations on each block.

SHA 1 AlgorithmShiva RamDam

The document describes the SHA-1 hashing algorithm. SHA-1 produces a 160-bit hash value from an input of arbitrary length. It works by padding the input, appending the length, initializing hash buffers, processing the message through 80 rounds of compression, and outputting the final hash value. The compression function divides the padded message into 16-word blocks and schedules the words through the rounds using a message scheduling algorithm. It performs logical and bitwise operations on the words and chaining variables to generate a new hash.

Hash Function ssuserdfb2da

This document discusses cryptographic hash functions including their applications in message authentication and digital signatures. It describes the requirements for hash functions to be secure including resistance to brute force attacks and cryptanalysis. The document outlines some simple hash functions and provides details on the Secure Hash Algorithm (SHA) family of cryptographic hash functions used in standards like SHA-512 which operates on 1024-bit blocks through 80 rounds. It also mentions NIST's selection of the Keccak algorithm as the new SHA-3 standard.

Message digest 5Tirthika Bandi

MD5 is a cryptographic hash function that produces a 128-bit hash value for a message of any length. It was originally designed to provide authentication of digital signatures but is no longer considered reliable for cryptography due to techniques that can generate collisions. MD5 operates by padding the input, appending the length, dividing into blocks, initializing variables, processing blocks through 4 rounds of operations with different constants each round, and outputting the hash value. While it was intended to be difficult to find collisions or recover the input, MD5 is no longer considered cryptographically secure due to attacks demonstrating collisions.

The MD5 hashing algorithmBob Landstrom

DES (Data Encryption Standard) pressentationsarhadisoftengg

This document discusses data encryption methods. It defines encryption as hiding information so it can only be accessed by those with the key. There are two main types: symmetric encryption uses one key, while asymmetric encryption uses two different but related keys. Encryption works by scrambling data using techniques like transposition, which rearranges the order, and substitution, which replaces parts with other values. The document specifically describes the Data Encryption Standard (DES) algorithm and the public key cryptosystem, which introduced the innovative approach of using different keys for encryption and decryption.

SHA 1 Algorithm.pptRajapriya82

Information and data security cryptographic hash functionsMazin Alwaaly

This document discusses hash functions and their cryptographic applications. It begins by defining hash functions and their properties like one-wayness and collision resistance. It then discusses various applications of cryptographic hash functions like message authentication codes, digital signatures, password files, and more. It provides details on how hash functions are used for message authentication and digital signatures. It also describes the Secure Hash Algorithm family of hash functions like SHA-1, SHA-2, and the NIST competition for the SHA-3 standard.

AesMuhammad Asif

The document summarizes the Advanced Encryption Standard (AES). It describes how AES was selected by NIST as a replacement for DES. AES (Rijndael cipher) uses a block size of 128 bits, with key sizes of 128, 192, or 256 bits. It operates on data in rounds that include byte substitution, shifting rows, mixing columns, and adding the round key. The key is expanded into an array of words used for each round.

Secure hashing algorithmKarteek Paruchuri

This document discusses secure hashing algorithms used for authentication rather than encryption. It provides an overview of the requirements for authentication including preventing masquerading, content modification, sequence modification, and timing modification. It then describes the basic theory behind hashing including producing a message digest, ensuring it is computationally infeasible to find two messages with the same digest, and being unable to recreate a message from its digest. Finally, it details the framework of the SHA-1 hashing algorithm including preprocessing the message, initializing buffers, processing the message in blocks, and outputting the final digest.

SHA- Secure hashing algorithmRuchi Maurya

Security Hash Algorithm (SHA) was developed in 1993 by the National Institute of Standards and Technology (NIST) and National Security Agency (NSA). It was designed as the algorithm to be used for secure hashing in the US Digital Signature Standard. • Hashing function is one of the most commonly used encryption methods. A hash is a special mathematical function that performs one-way encryption. • SHA-l is a revised version of SHA designed by NIST and was published as a Federal Information Processing Standard (FIPS). • Like MD5, SHA-l processes input data in 512-bit blocks. • SHA-l generates a 160-bit message digest. Whereas MD5 generated message digest of 128 bits. • The procedure is used to send a non secret but signed message from sender to receiver. In such a case following steps are followed: 1. Sender feeds a plaintext message into SHA-l algorithm and obtains a 160-bit SHA-l hash. 2. Sender then signs the hash with his RSA private key and sends both the plaintext message and the signed hash to the receiver. 3. After receiving the message, the receiver computes the SHA-l hash himself and also applies the sender's public key to the signed hash to obtain the original hash H.

symmetric key encryption algorithmsRashmi Burugupalli

Symmetric Key Encryption Algorithms can be categorized as stream ciphers or block ciphers. Block ciphers like the Data Encryption Standard (DES) operate on fixed-length blocks of bits, while stream ciphers process messages bit-by-bit. DES is an example of a block cipher that encrypts 64-bit blocks using a 56-bit key. International Data Encryption Algorithm (IDEA) is another block cipher that uses a 128-bit key and 64-bit blocks, employing addition and multiplication instead of XOR like DES. IDEA consists of 8 encryption rounds followed by an output transformation to generate the ciphertext from the plaintext and key.

Topic20 The RC4 Algorithm.pptxUrjaDhabarde

DESNaga Srimanyu Timmaraju

DES was developed as a standard for communications and data protection by an IBM research team in response to a request from the National Bureau of Standards (now called NIST). DES uses the techniques of confusion and diffusion achieved through numerous permutations and the XOR operation. The basic DES process encrypts a 64-bit block using a 56-bit key over 16 complex rounds consisting of permutations and key-dependent calculations. Triple DES was developed as a more secure version of DES.

MD5 ALGORITHM.pptxRajapriya82

The MD5 algorithm is a cryptographic hash function that generates a 128-bit digest from a message of any length. It works by first padding the message to a length that is a multiple of 512 bits, then appending the message length. It initializes buffers and processes the message in 512-bit blocks using four rounds of 16 operations each, applying different functions to update the buffers. The final buffer values become the MD5 digest. It is commonly used to verify file integrity but is now considered insecure due to possible hash collisions.

Hash functionHarry Potter

The document discusses hash functions and message authentication codes (MACs). It begins by defining hash functions and MACs, noting that hash functions generate a fingerprint for a message without a key while MACs use a keyed hash function. It then covers security requirements for hash functions like one-wayness and collision resistance. Popular hash functions are described like MD5, SHA-1, and the SHA-2 family. Constructions for hash functions based on block ciphers and iterated hash functions are also outlined. The document concludes by comparing hash functions and MACs and describing common MAC constructions.

Cryptographic Algorithms: DES and RSAaritraranjan

MD-5 : AlgorithmSahil Kureel

The document discusses the MD5 algorithm, which takes an input message of arbitrary length and produces a 128-bit fingerprint or message digest. It describes the technical process, including padding the message, appending the length, initializing buffers, processing the message in 16-word blocks using four auxiliary functions, and outputting the final message digest consisting of the values A, B, C, and D. The MD5 algorithm provides a secure way to compress a large file before encryption.

Design of Secure Hash Algorithm(SHA)Saravanan T.M

Hash function Salman Memon

A hash function usually means a function that compresses, meaning the output is shorter than the input A hash function takes a group of characters (called a key) and maps it to a value of a certain length (called a hash value or hash). The hash value is representative of the original string of characters, but is normally smaller than the original. This term is also known as a hashing algorithm or message digest function. Hash functions also called message digests or one-way encryption or hashing algorithm. http://phpexecutor.com

Hash FunctionSiddharth Srivastava

This document discusses message authentication techniques including message encryption, message authentication codes (MACs), and hash functions. It describes how each technique can be used to authenticate messages and protect against various security threats. It also covers how symmetric and asymmetric encryption can provide authentication when used with MACs or digital signatures. Specific MAC and hash functions are examined like HMAC, SHA-1, and SHA-2. X.509 is introduced as a standard for digital certificates.

SHA-256.pptxJadhavSujeet

SHA - 256 Algorithm is an concept of Block Chain Technology . It is an Hashing method, Hashing is the process of scrambling raw information to the extent that it cannot reproduce it back to its original form. SHA-256 is a part of the SHA 2 family of algorithms, where SHA stands for Secure Hash Algorithm. Published in 2001. It's applications include hash tables, integrity verification, challenge handshake authentication, digital signatures, etc.I have also given an complete solved example of this algorithm.

AES-Advanced Encryption StandardPrince Rachit

Message Authentication Code & HMACKrishna Gehlot

This document discusses message authentication codes (MACs). It explains that MACs use a shared symmetric key to authenticate messages, ensuring integrity and validating the sender. The document outlines the MAC generation and verification process, and notes that MACs provide authentication but not encryption. It then describes HMAC specifically, which applies a cryptographic hash function to the message and key to generate the MAC. The key steps of the HMAC process are detailed.

Hash Function & AnalysisPawandeep Kaur

This document discusses hash functions and their analysis for a network security seminar. It begins by defining a hash function as a mathematical function that converts a large amount of data into a small string of integers. Common applications of hash functions include hash tables for quickly searching data, eliminating data redundancy, caches, bloom filters, and pattern matching. Cryptographic hash functions have properties like preimage and second preimage resistance as well as collision resistance. Popular cryptographic hash functions discussed include MD2, MD4, MD5, SHA-1, and SHA-2, along with their advantages, limitations, and examples of attacks.

Network security cryptographic hash functionMijanur Rahman Milon

This document discusses cryptographic hash functions. It defines hashing as transforming a variable length string into a shorter, fixed length value. Cryptographic hash functions are designed to be one-way and resistant to tampering. They are important for security applications like digital signatures, message authentication and password verification. Commonly used hash functions include MD5 and SHA-1 which take arbitrary inputs and produce fixed-length outputs.

Confusion and Diffusion.pptxbcanawakadalcollege

According to Claude Shannon, confusion and diffusion are two key properties for building strong encryption algorithms. Confusion obscures the relationship between the ciphertext and key by having each ciphertext bit depend on multiple key bits. Diffusion spreads the influence of each plaintext symbol over many ciphertext symbols. Modern block ciphers use repeated rounds of confusion and diffusion operations to build strong encryption.

Secure Hash Algorithm (SHA-512)DUET

Cryptographic Hash Functions in Security.pptxVivekanandaGN1

Hashing Algorithm: MD5ijsrd.com

This document discusses the MD5 hashing algorithm. It begins by defining message digests and their purpose in detecting changes to data. It then provides details on the MD5 algorithm, including that it produces a 128-bit hash value and describes the main steps of the algorithm. It also discusses how MD5 can be used to authenticate file transmissions by comparing hash values of the sent and received files.

More Related Content

What's hot (20)

AesMuhammad Asif

Secure hashing algorithmKarteek Paruchuri

SHA- Secure hashing algorithmRuchi Maurya

symmetric key encryption algorithmsRashmi Burugupalli

Topic20 The RC4 Algorithm.pptxUrjaDhabarde

DESNaga Srimanyu Timmaraju

MD5 ALGORITHM.pptxRajapriya82

Hash functionHarry Potter

Cryptographic Algorithms: DES and RSAaritraranjan

MD-5 : AlgorithmSahil Kureel

Design of Secure Hash Algorithm(SHA)Saravanan T.M

Hash function Salman Memon

Hash FunctionSiddharth Srivastava

SHA-256.pptxJadhavSujeet

AES-Advanced Encryption StandardPrince Rachit

Message Authentication Code & HMACKrishna Gehlot

Hash Function & AnalysisPawandeep Kaur

Network security cryptographic hash functionMijanur Rahman Milon

Confusion and Diffusion.pptxbcanawakadalcollege

Secure Hash Algorithm (SHA-512)DUET

AesMuhammad Asif

Secure hashing algorithmKarteek Paruchuri

SHA- Secure hashing algorithmRuchi Maurya

symmetric key encryption algorithmsRashmi Burugupalli

Topic20 The RC4 Algorithm.pptxUrjaDhabarde

DESNaga Srimanyu Timmaraju

MD5 ALGORITHM.pptxRajapriya82

Hash functionHarry Potter

Cryptographic Algorithms: DES and RSAaritraranjan

MD-5 : AlgorithmSahil Kureel

Design of Secure Hash Algorithm(SHA)Saravanan T.M

Hash function Salman Memon

Hash FunctionSiddharth Srivastava

SHA-256.pptxJadhavSujeet

AES-Advanced Encryption StandardPrince Rachit

Message Authentication Code & HMACKrishna Gehlot

Hash Function & AnalysisPawandeep Kaur

Network security cryptographic hash functionMijanur Rahman Milon

Confusion and Diffusion.pptxbcanawakadalcollege

Secure Hash Algorithm (SHA-512)DUET

Similar to Cryptographic hash function md5 (20)

Cryptographic Hash Functions in Security.pptxVivekanandaGN1

Hashing Algorithm: MD5ijsrd.com

An Enhanced Message Digest Hash Algorithm for Information Securitypaperpublications3

Abstract: Information is an important commodity in the world of Electronic communication. To achieve a secure communication between communicating parties, the protection of authenticity and integrity of information is necessary. Cryptographic hash functions play a central role in cryptology. A cryptographic hash function takes an input of arbitrary large size and returns a small fixed size hash value. It satisfies three major cryptographic properties: preimage resistance, second preimage resistance and collision resistance. Due to its cryptographic properties hash function has become an important cryptographic tool which is used to protect information authenticity and integrity. This thesis presents a review of cryptographic hash functions. The thesis includes various applications of hash functions. It gives special emphasis on dedicated hash functions MD5. Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. In the past few years, there have been significant research advances in the analysis of hash functions and it was shown that none of the hash algorithm is secure enough for critical purposes whether it is MD5 or SHA-1. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD. So the purpose of this thesis is combination of some function to reinforce these functions and also increasing hash code of message digest of length up to 160 that makes stronger algorithm against collision and brute force attacks.

A Comparative Analysis between SHA and MD5 algorithms Er Piyush Gupta IN ⊞⌘

Message Digest message digest ppttsx.pptxLaxmipujaBiradar

A technical writing on cryptographic hash function md5Khulna University, Khulna, Bangladesh

A cryptographic hash function, H is a function that transforms a string of any length to a fixed length string. Cryptography is basically used for data security. Encryption is an ancient concept. It has been using since the great king Julius Seger. As far as data manipulation speed increases with time those encryption methods are becoming easy to understand. So a more hard method is inventing day by day.

Cs8792 cns - unit ivArthyR3

This document provides an overview of message authentication and integrity. It discusses the need for authentication in network security and outlines different authentication functions including message encryption, message authentication codes (MACs), and hash functions. It describes how MACs are generated using a secret key and message and provides the requirements for MACs. The document also discusses the MD5 and SHA hash algorithms, explaining their processes and analyzing their security strengths and weaknesses.

Cs8792 cns - unit ivArthyR3

Data streaming algorithmsHridyesh Bisht

ENGG_CSE_III_YEAR_Message_Digest_MD_5.pptSakethBhargavaRallap

ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_ENGG_CSE_III_YEAR_

CnsArthyR3

This document discusses message authentication and hash functions. It begins by defining message authentication and its security requirements. It then describes three approaches to message authentication: message encryption, message authentication codes (MACs), and hash functions. It provides details on how MACs and hash functions work, including properties and requirements. Specific algorithms like MD5 are also covered. The document aims to explain the concepts and tradeoffs between different message authentication techniques.

IRJET - Hash Functions and its Security for SnagsIRJET Journal

This document provides an overview of cryptographic hash functions, including their structure, properties, and selections in previous research projects. It discusses the Merkle-Damgard and sponge constructions commonly used to design hash functions. The document also summarizes the hash functions evaluated and selected in the NESSIE and CRYPTREC projects, such as Whirlpool, SHA-256, and SHA-512 in NESSIE and MD5, RIPEMD-160, and SHA-1 in CRYPTREC.

introduction to MD5 Massage Digest Algorithm.pptmadlord2

This document summarizes the MD5 message digest algorithm. It was developed by Professor Ronald L. Rivest in 1991 to take an input of arbitrary length and produce a 128-bit fingerprint. The MD5 algorithm structure and implementation steps are described, including padding the input, appending the length, initializing buffers, and processing the message in 16-word blocks through four rounds of functions. Performance is provided showing MD5 is very fast on 32-bit machines. MD5 is compared to MD4, noting changes made and that it is widely used and considered efficient.

Hash mac algorithmsTony Nguyen

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It works by padding the message, appending the length, initializing buffers, processing the message in blocks through compression functions, and outputting the hash value. HMAC is a MAC algorithm that incorporates a secret key into an existing hash function like MD5 or SHA. It works by padding the key, XORing it with ipad or opad, appending the message or hash, and applying the hash function to produce the

Hash mac algorithmsDavid Hoen

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It works by padding and processing the message in blocks, using a compression function and initialization vector. HMAC is a MAC algorithm that incorporates a secret key into the hashing process. It works by XORing the key with ipad and opad pads, hashing the padded message, and outputting the result. HMAC allows existing hash functions to be used for message authentication in a way that relies on the secret

Hash mac algorithmsFraboni Ec

This document provides an overview of hash functions, secure hash algorithms (SHA), and HMAC. It describes how hash functions work by taking a message and producing a fixed-size hash value. SHA algorithms like SHA-1, SHA-256, SHA-384, and SHA-512 are described as secure hash functions developed by NIST. The document outlines the 5 steps of the SHA-512 algorithm: 1) append padding bits, 2) append length, 3) initialize hash buffer, 4) process message in blocks, and 5) output hash value. HMAC is then introduced as a way to incorporate a secret key into an existing hash algorithm like MD5 or SHA-1 to produce a message authentication code

Hash& mac algorithmsHarry Potter

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It involves padding the message, initializing a buffer, processing the message in blocks through a compression function, and outputting the final hash. HMAC is a MAC algorithm that incorporates a secret key into an existing hash function like MD5 or SHA. It pads and XORs the key, hashes the result with the message, then hashes again with a padded key to produce the MAC value.

Hash mac algorithmsLuis Goldster

Hash mac algorithmsJames Wong

This document discusses hash and MAC algorithms. It provides details on hash functions, the Secure Hash Algorithm (SHA), and HMAC. Hash functions take a message and produce a fixed-size hash value. SHA is a secure hash algorithm developed by NIST that produces 160-bit or longer hash values. It works by padding and processing the message in blocks, using a compression function and initialization vector. HMAC is a MAC algorithm that incorporates a secret key into an existing hash function like MD5 or SHA. It works by XORing the key with ipad and opad pads, hashing the padded message, and outputting the result. HMAC executes with similar speed to the underlying hash function.

Hash mac algorithmsYoung Alista

Cryptographic Hash Functions in Security.pptxVivekanandaGN1

Hashing Algorithm: MD5ijsrd.com

An Enhanced Message Digest Hash Algorithm for Information Securitypaperpublications3

A Comparative Analysis between SHA and MD5 algorithms Er Piyush Gupta IN ⊞⌘

Message Digest message digest ppttsx.pptxLaxmipujaBiradar

A technical writing on cryptographic hash function md5Khulna University, Khulna, Bangladesh

Cs8792 cns - unit ivArthyR3

Data streaming algorithmsHridyesh Bisht

ENGG_CSE_III_YEAR_Message_Digest_MD_5.pptSakethBhargavaRallap

CnsArthyR3

IRJET - Hash Functions and its Security for SnagsIRJET Journal

introduction to MD5 Massage Digest Algorithm.pptmadlord2

Hash mac algorithmsTony Nguyen

Hash mac algorithmsDavid Hoen

Hash mac algorithmsFraboni Ec

Hash& mac algorithmsHarry Potter

Hash mac algorithmsLuis Goldster

Hash mac algorithmsJames Wong

Hash mac algorithmsYoung Alista

Recently uploaded (20)

PHYSIOLOGY MCQS By DR. NASIR MUSTAFA (PHYSIOLOGY)Dr. Nasir Mustafa

Tax evasion, Tax planning & Tax avoidance.pptxmanishbaidya2017

Myopathies (muscle disorders) for undergraduateMohamed Rizk Khodair

How to Configure Scheduled Actions in odoo 18Celine George

APGAR SCORE BY sweety Tamanna Mahapatra MSc PediatricSweetytamannaMohapat

Redesigning Education as a Cognitive Ecosystem: Practical Insights into Emerg...Leonel Morgado

All About the 990 Unlocking Its Mysteries and Its Power.pdfTechSoup

Herbs Used in Cosmetic Formulations .pptxRAJU THENGE

Rock Art As a Source of Ancient Indian HistoryVirag Sontakke

This Presentation is prepared for Graduate Students. A presentation that provides basic information about the topic. Students should seek further information from the recommended books and articles. This presentation is only for students and purely for academic purposes. I took/copied the pictures/maps included in the presentation are from the internet. The presenter is thankful to them and herewith courtesy is given to all. This presentation is only for academic purposes.

Bridging the Transit Gap: Equity Drive Feeder Bus Design for Southeast Brooklyni4jd41bk

Grade 2 - Mathematics - Printable WorksheetSritoma Majumder

How to Manage Purchase Alternatives in Odoo 18Celine George

Ajanta Paintings: Study as a Source of HistoryVirag Sontakke

Biophysics Chapter 3 Methods of Studying Macromolecules.pdfPKLI-Institute of Nursing and Allied Health Sciences Lahore , Pakistan.

This chapter provides an in-depth overview of the viscosity of macromolecules, an essential concept in biophysics and medical sciences, especially in understanding fluid behavior like blood flow in the human body. Key concepts covered include: ✅ Definition and Types of Viscosity: Dynamic vs. Kinematic viscosity, cohesion, and adhesion. ⚙️ Methods of Measuring Viscosity: Rotary Viscometer Vibrational Viscometer Falling Object Method Capillary Viscometer 🌡️ Factors Affecting Viscosity: Temperature, composition, flow rate. 🩺 Clinical Relevance: Impact of blood viscosity in cardiovascular health. 🌊 Fluid Dynamics: Laminar vs. turbulent flow, Reynolds number. 🔬 Extension Techniques: Chromatography (adsorption, partition, TLC, etc.) Electrophoresis (protein/DNA separation) Sedimentation and Centrifugation methods.

Ancient Stone Sculptures of India: As a Source of Indian HistoryVirag Sontakke

Grade 3 - English - Printable Worksheet (PDF Format)Sritoma Majumder

BỘ ĐỀ TUYỂN SINH VÀO LỚP 10 TIẾNG ANH - 25 ĐỀ THI BÁM SÁT CẤU TRÚC MỚI NHẤT, ...Nguyen Thanh Tu Collection

Lecture 2 CLASSIFICATION OF PHYLUM ARTHROPODA UPTO CLASSES & POSITION OF_1.pptxArshad Shaikh

LDMMIA Reiki News Ed3 Vol1 For Team and GuestsLDM Mia eStudios

Happy May and Taurus Season. ♥☽✷♥We have a large viewing audience for Presentations. So far my Free Workshop Presentations are doing excellent on views. I just started weeks ago within May. I am also sponsoring Alison within my blog and courses upcoming. See our Temple office for ongoing weekly updates. https://ldmchapels.weebly.com ♥☽About: I am Adult EDU Vocational, Ordained, Certified and Experienced. Course genres are personal development for holistic health, healing, and self care/self serve.

pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulsesushreesangita003

PHYSIOLOGY MCQS By DR. NASIR MUSTAFA (PHYSIOLOGY)Dr. Nasir Mustafa

Tax evasion, Tax planning & Tax avoidance.pptxmanishbaidya2017

Myopathies (muscle disorders) for undergraduateMohamed Rizk Khodair

How to Configure Scheduled Actions in odoo 18Celine George

APGAR SCORE BY sweety Tamanna Mahapatra MSc PediatricSweetytamannaMohapat

Redesigning Education as a Cognitive Ecosystem: Practical Insights into Emerg...Leonel Morgado

All About the 990 Unlocking Its Mysteries and Its Power.pdfTechSoup

Herbs Used in Cosmetic Formulations .pptxRAJU THENGE

Rock Art As a Source of Ancient Indian HistoryVirag Sontakke

Bridging the Transit Gap: Equity Drive Feeder Bus Design for Southeast Brooklyni4jd41bk

Grade 2 - Mathematics - Printable WorksheetSritoma Majumder

How to Manage Purchase Alternatives in Odoo 18Celine George

Ajanta Paintings: Study as a Source of HistoryVirag Sontakke

Biophysics Chapter 3 Methods of Studying Macromolecules.pdfPKLI-Institute of Nursing and Allied Health Sciences Lahore , Pakistan.

Ancient Stone Sculptures of India: As a Source of Indian HistoryVirag Sontakke

Grade 3 - English - Printable Worksheet (PDF Format)Sritoma Majumder

BỘ ĐỀ TUYỂN SINH VÀO LỚP 10 TIẾNG ANH - 25 ĐỀ THI BÁM SÁT CẤU TRÚC MỚI NHẤT, ...Nguyen Thanh Tu Collection

Lecture 2 CLASSIFICATION OF PHYLUM ARTHROPODA UPTO CLASSES & POSITION OF_1.pptxArshad Shaikh

LDMMIA Reiki News Ed3 Vol1 For Team and GuestsLDM Mia eStudios

pulse ppt.pptx Types of pulse , characteristics of pulse , Alteration of pulsesushreesangita003

Cryptographic hash function md5

1. Cryptographic Hash Function: MD5 1 1 Md. Shahidul Islam CSE, KU [email protected]

2. Outline  Introduction Features Application Algorithm Hash analysis Drawbacks 2 2

3. Introduction  A cryptographic hash function is a kind of algorithm that can be run on a piece of data, like an individual file or a password, producing a value called a checksum.  MD5 (Message-Digest algorithm 5) is a widely used cryptographic hash function designed by Ronald L. Rivest in 1991.  It is one in a series of message digest algorithms. 3 3

4. Features of a hash function  Fixed Length Output (Hash Value)  Efficiency in computing  Collision Resistance, two different message should not have the same hash value  Deterministic so the same message always results in the same hash  Infeasible to generate a message from its hash value except by trying all possible messages 4 4

5. Application  There are two types of application of hash function: 1. Password Storage 2. Data Integrity Check 5 5

6. Application (Cont.)  MD5 is used to store hash passwords and verify when user login.  An intruder can only see the hashes of passwords, even if he accessed the password. 6 6

7. Application (Cont.) 7 7

8. Application (Cont.)  The integrity check helps the user to detect any changes made to original file. 8 8

9. Algorithm 9 9 Step 1: Append padded bits: • The message is padded so that, length mod 512 = 448 • A single “1” bit is appended to the message, and then “0” bits are appended so that the length in bits equals 448 modulo 512. Message 1 0 0 0 0 0 (Message length + padded bits) % 512 = 448

10. Algorithm (Cont.) 10 10 Step 2: Append length: • A 64 bit integer representation of message is appended to the result of the previous step. • The resulting message has a length that is an exact multiple of 512 bits. Message 1 0 0 0 0 0 64bits (Message length + padded bits + 64 bits ) % 512 = 0

11. Algorithm (Cont.) 11 Step 3: Initialize MD Buffer: • A four-word buffer (A,B,C,D) is used to compute the message digest. • These are initialized to the following values in hexadecimal: A: 01 23 45 67 B: 89 ab cd ef C: fe dc ba 98 D: 76 54 32 10

12. Algorithm (Cont.) 12 Step 4: Process message in 16-word blocks: • Four auxiliary functions that take as input three 32-bit words and produce as output one 32-bit word. F(X, Y, Z) = (X ˄ Y) ˅ (¬ X ˄ Z) G(X, Y, Z) = (X ˄ Z) ˅ (Y ˄ ¬ Z) H(X, Y, Z) = X  Y  Z I(X, Y, Z) = Y  (X ˅ ¬Z)

13. Algorithm (Cont.) 13 Step 5: Output: • The message digest produced as output is A, B, C, D. • That is, output begins with the low-order byte of A, and end with the high-order byte of D. A1 A2 . . . . . . . . . . . . . . . . . . . . D3 128 bits = 32 hexadecimal digits A1, A2 are bytes

14. Hash analysis 14 • A small change in original message and the output digest is completely different

15. Hash analysis (Cont.) 15 • Arbitrary message length to fixed length digest • For MD5 128 bits = 32bits hexadecimal

16. Drawbacks  In 1993 a hash collision was found in MD5 compression function.  In 2009 a preimage attack against MD5 was published that breaks MD5’s preimage resistance.  In 2012, the most infamous attack happened by the Flame Malware. The CMU Software Engineering Institute considers MD5 "cryptographically broken and unsuitable for further use". 16 16

17. Drawbacks (Cont.)  For cracking password crackers use rainbow table  Salting process can make rainbow table ineffective 17 17

18. Thank You 18

Editor's Notes

#4: A checksum is a small-sized datum derived from a block of digital data for the purpose of detecting errors. - wikipedia
#8: Image source: Internet
#9: Image source: Internet
#17: A preimage attack on cryptographic hash functions tries to find a message that has a specific hash value.

Cryptographic hash function md5

Recommended

More Related Content

What's hot (20)

Similar to Cryptographic hash function md5 (20)

Recently uploaded (20)

Cryptographic hash function md5

Editor's Notes