6fb52297e004844aa81be d50cc3545bc Hashing!. Hashing  Group Activity 1:  Take the message you were given, and create your own version of hashing.  You.

Slides:



Advertisements
Similar presentations
Hashes and Message Digests
Advertisements

Hash Functions A hash function takes data of arbitrary size and returns a value in a fixed range. If you compute the hash of the same data at different.
By Wild King. Generally speaking, a rainbow table is a lookup table which is used to recover the plain-text password that derives from a hashing or cryptographic.
Use of a One-Way Hash without a Salt
Lecture 5: Cryptographic Hashes
Hash Function. What are hash functions? Just a method of compressing strings – E.g., H : {0,1}*  {0,1} 160 – Input is called “message”, output is “digest”
ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.
CS 6262 Spring 02 - Lecture #7 (Tuesday, 1/29/2002) Introduction to Cryptography.
Chapter User authorization & safety Maciej Mensfeld Presented by: Maciej Mensfeld User authorization & safety dev.mensfeld.pl.
Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.
PIITMadhumita Chatterjee Security 1 Hashes and Message Digests.
1 Chapter 5 Hashes and Message Digests Instructor: 孫宏民 Room: EECS 6402, Tel: , Fax :
Hash functions a hash function produces a fingerprint of some file/message/data h = H(M)  condenses a variable-length message M  to a fixed-sized fingerprint.
Hashes and Message Digest Hash is also called message digest One-way function: d=h(m) but no h’(d)=m –Cannot find the message given a digest Cannot find.
By: Matthew Ng. SHA stands for Secure Hash Algorithm It is based off the Merkle-Dangard hash function There are 3 versions of it with one coming in 2012.
Chapter 4  Hash Functions 1 Overview  Cryptographic hash functions are functions that: o Map an arbitrary-length (but finite) input to a fixed-size output.
Secure Hashing and DSS Sultan Almuhammadi ICS 454 Principles of Cryptography.
Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.
Feb 19, 2002Mårten Trolin1 Previous lecture Practical things about the course. Example of cryptosystem — substitution cipher. Symmetric vs. asymmetric.
Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Fmdszqujpo! Encryption!. Encryption  Group Activity 1:  Take the message you were given, and create your own encryption.  You can encrypt it anyway.
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.
Lecture 15 Lecture’s outline Public algorithms (usually) that are each other’s inverse.
Week 5 - Monday.  What did we talk about last time?  Cryptographic hash functions.
MS systems use one of the following: LanManager Hash (LM) LanManager Hash (LM) NT LanManager (NTLM) NT LanManager (NTLM) Cached passwords Cached passwords.
Lecture 19 Page 1 CS 111 Online Symmetric Cryptosystems C = E(K,P) P = D(K,C) E() and D() are not necessarily the same operations.
HASH Functions.
Hash Functions A hash function H accepts a variable-length block of data M as input and produces a fixed-size hash value h = H(M) Principal object is.
Dan Johnson. What is a hashing function? Fingerprint for a given piece of data Typically generated by a mathematical algorithm Produces a fixed length.
Digital Crime Scene Investigative Process
Databases and security continued CMSC 461 Michael Wilson.
Brute Force Password Cracking and its Role in Penetration Testing Andrew Keener and Uche Iheadindu.
CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.
Module 3 – Cryptography Cryptography basics Ciphers Symmetric Key Algorithms Public Key Algorithms Message Digests Digital Signatures.
Hashing Algorithms: Basic Concepts and SHA-2 CSCI 5857: Encoding and Encryption.
Theory of Computation II Topic presented by: Alberto Aguilar Gonzalez.
CSCI 172/283 Fall 2010 Hash Functions, HMACs, and Digital Signatures.
1 Network Security Lecture 5 Hashes and Message Digests Waleed Ejaz
6.375 Final Presentation Jeff Simpson, Jingwen Ouyang, Kyle Fritz FPGA Implementation of Whirlpool and FSB Hash Algorithms.
Public / Private Keys was a big year… DES: Adopted as an encryption standard by the US government. It was an open standard. The NSA calls it “One.
Lecture 2: Introduction to Cryptography
Week 4 - Friday.  What did we talk about last time?  Snow day  But you should have read about  Key management.
CRYPTOGRAPHY. WHAT IS PUBLIC-KEY ENCRYPTION? Encryption is the key to information security The main idea- by using only public information, a sender can.
Cryptographic Hash Functions Prepared by Dr. Lamiaa Elshenawy
Hash Functions Ramki Thurimella. 2 What is a hash function? Also known as message digest or fingerprint Compression: A function that maps arbitrarily.
© Copyright 2009 SSLPost 01. © Copyright 2009 SSLPost 02 a recipient is sent an encrypted that contains data specific to that recipient the data.
Cryptographic Hash Functions
CS426Fall 2010/Lecture 51 Computer Security CS 426 Lecture 5 Cryptography: Cryptographic Hash Function.
MD5 & Hash Encryption By Alex Buzak. Overview Purpose of MD5 and Hash Encryptions Examples MD5 Algorithm Explanation of Possible Security Risks Practical.
Network Security. Three tools Hash Function Block Cipher Public Key / Private Key.
Hashes Lesson Introduction ●The birthday paradox and length of hash ●Secure hash function ●HMAC.
1 Cryptography Troy Latchman Byungchil Kim. 2 Fundamentals We know that the medium we use to transmit data is insecure, e.g. can be sniffed. We know that.
Lecture 5 Page 1 CS 236 Online More on Cryptography CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.
CSCI 530 Lab Passwords. Overview Authentication Passwords Hashing Breaking Passwords Dictionary Hybrid Brute-Force Rainbow Tables Detection.
 Encryption provides confidentiality  Information is unreadable to anyone without knowledge of the key  Hashing provides integrity  Verify the integrity.
1 Message Authentication using Message Digests and the MD5 Algorithm Message authentication is important where undetected manipulation of messages can.
Data Integrity / Data Authentication. Definition Authentication (Signature) algorithm - A Verification algorithm - V Authentication key – k Verification.
Cryptographic Hash Function. A hash function H accepts a variable-length block of data as input and produces a fixed-size hash value h = H(M). The principal.
@Yuan Xue 285: Network Security CS 285 Network Security Hash Algorithm Yuan Xue Fall 2012.
Cryptographic Hash Function
Chapter 5: The Art of Ensuring Integrity
Network Security.
Cryptographic Hash Functions
ICS 454 Principles of Cryptography
Kiran Subramanyam Password Cracking 1.
ICS 454 Principles of Cryptography
Network Security.
Exercise: Hashing, Password security, And File Integrity
Hash Function Requirements
Presentation transcript:

6fb52297e004844aa81be d50cc3545bc Hashing!

Hashing  Group Activity 1:  Take the message you were given, and create your own version of hashing.  You can hash it anyway you want  Try to make an interesting version that you think no other group will be able to guess!  Bring the hashed message up when you finish it for later use

Discussion  What do you think hashing is?  Where do you think a good place is to use hashing?

Definitions  A hash function is any function that can be used to map digital data of arbitrary size to digital data of fixed size. The values returned by a hash function are called hash values, hash codes, hash sums, or simply hashes. --wikipediafunctiondata  Some of the places hashing is used:  it is used for password storing in OS’s  a table that is used to sort data quickly and be able to retrieve it quickly  verifying if a file is the same when you download it as it was when it was hashed and uploaded

Cracking Activity 1  For this activity, we will try to break each encrypted message.  Each group choose a message (other than your own!) and take a little time to try to break it. You can go online and look for online tools to do this if you want since we haven’t gone over how to break hashing yet.  After a little bit of time we will go around the room and see if you got the message, and if you did, tell us. Also, if you did, tell us what type of hashing was used.  For the ones that weren’t broken, we’ll have the groups that made them tell us what the hashing was and what the message was.

Cracking Activity 1  List of hashed messages:

Definitions 2  What is a cryptographic function?  A cryptographic hash function is a hashing function which is thought to be pretty close to impossible to crack (get the message) when just given the hash value. You can think of it like a one way street. You give it the input and the function produces a hash value, but given the hash value, you can’t figure out the input if you don’t know the hash function (brute force attempts at solving would take way too much time and effort).

Definitions 2 cont.  What is a password hashing function?  A password hashing function is a function that takes the input (in this case a password), combines/concatenates it with a salt (which is random data that is randomly generated for each user), then uses a cryptographic hash function to create a hash. The hash is stored in a database with the salt, and when a user inputs a password then the process repeats and the newly created hash is compared with the hash for the original password, and if they match then they can log in.

Hashing Example 1  Go to  We will use this site as a simple example of how to use hashcat to break a hash  Let’s step through this example to see how hashcat on kali works

Hashing Example 2  This example we will also walk through how to crack hashes using hashcat.  First go to: passwords-using-hashcat/ passwords-using-hashcat/  Next, work on this with your partner as I step through it with you

Definitions 3  First up is MD5.  Has a hash value of size 128 bits, which is usually displayed as a 32 digit hexadecimal value.  Between 2004 and 2008, there were a number of flaws found with the MD5 algorithm, and is no longer used for security purposes (at least in government and corporate applications).  This function uses a block cipher, and goes through a process of 4 rounds with the cipher to create the hash.

Definitions 3 cont.  Next up is SHA-1.  has a hash value of 160 bits, which is bigger than MD5 and is displayed as a 40 digit hexadecimal number.  This function was a spiritual successor to MD5, and a lot of applications used it until about  This function uses a block cipher as well, and goes through a process of 80 rounds with the cipher to create the hash.

Definitions 3 cont.  Finally, let’s talk about SHA-2.  This function has 6 versions of itself, with varying lengths: SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, SHA-512/256.  the bit size values are 224, 256, 384, or 512 respectfully.  This function was created by the NSA.  This function has 2 different amounts of rounds as well, 64 or 80 rounds with block ciphers.

Group Activity 2  Doing this activity in our groups, let’s do some hash creation and cracking shall we.  First, create 12 hashes using different versions of hash (MD5, sha, etc)  Next, after creating your 12 hashes, make 3 lists with 4 different ones each and give them to the other groups  After each group has taken some hashes, go ahead and split up the hashes among the pairs in each group, and try to crack the hashes.  After we break them, we will go around the room and see what types they were and how hard it was to crack them; if some weren’t cracked, the group that made them will tell us what type of hash function it was made with