ECE 111 SHA-2 Algorithms.

Slides:

Advertisements

Similar presentations

Hashes and Message Digests

Advertisements

Lecture 5: Cryptographic Hashes

SECURE HASHING ALGORITHM By: Ruth Betcher. Purpose: Authentication Not Encryption Authentication Requirements:  Masquerade – Insertion of message from.

ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.

Outline Project 1 Hash functions and its application on security Modern cryptographic hash functions and message digest –MD5 –SHA.

MD Collision Sought Marian Ščerbák University of Pavol Jozef Šafárik Košice.

PIITMadhumita Chatterjee Security 1 Hashes and Message Digests.

1 Chapter 5 Hashes and Message Digests Instructor: 孫宏民 Room: EECS 6402, Tel: , Fax :

Hash and MAC Algorithms

Announcements: 1. HW7 due next Tuesday. 2. Inauguration today! Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs, Diffie-Hellman,

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.

Announcements:Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs, Diffie-Hellman, ElGamal Hash Functions and SHA-1 Hash Functions.

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.

Cryptography and Network Security Hash Algorithms.

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.

Information Security and Management 11

SHA (secure hash algorithm) Jen-Chang Liu, 2005 Adapted from lecture slides by Lawrie Brown.

Module 4 Hash Functions Highline Community College Seattle University University of Washington in conjunction with the National Science Foundation.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

1 Pertemuan 09 Hash and Message Digest Matakuliah: H0242 / Keamanan Jaringan Tahun: 2006 Versi: 1.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.

Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

1 Cryptography and Network Security (Various Hash Algorithms) Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Changed by Somesh Jha)

CipherTrust Proprietary & Confidential Jonathan A. Zdziarski, Weilai Yang, Paul Judge CipherTrust, Inc. APPROACHES TO PHISHING.

HASH Functions.

Hash and MAC Algorithms Dr. Monther Aldwairi New York Institute of Technology- Amman Campus 12/3/2009 INCS 741: Cryptography 12/3/20091Dr. Monther Aldwairi.

 Programmed for educational purposes  Efficiency sacrificed for clarity/explanation.

CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.

1 Hashes and Message Digests. 2 Hash Also known as –Message digest –One-way function Function: input message -> output One-way: d=h(m), but not h’(d)

12.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 12 Cryptographic Hash Functions.

Hashing Algorithms: Basic Concepts and SHA-2 CSCI 5857: Encoding and Encryption.

Hash and MAC Functions CS427 – Computer Security

1 Hash Functions. 2 A hash function h takes as input a message of arbitrary length and produces as output a message digest of fixed length

12.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 12 Cryptographic Hash Functions.

1 Network Security Lecture 5 Hashes and Message Digests Waleed Ejaz

Hash and Mac Algorithms. Contents Hash Functions Secure Hash Algorithm HMAC.

Cryptographic Hash Functions

If the hash algorithm is properly designed and distributes the hashes uniformly over the output space, "finding a hash collision" by random guessing is.

Chapter 18: One-Way Hash Functions Based on Schneier.

Team TDB Members: Anthony Knopp Zach Langley

Hash Algorithms see similarities in the evolution of hash functions & block ciphers –increasing power of brute-force attacks –leading to evolution in algorithms.

Lecture 4.2: Hash Functions: Design* CS 436/636/736 Spring 2012 Nitesh Saxena * some slides borrowed from Gene Tsudik.

Cryptographic Hash Functions and Protocol Analysis

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.

Computer Science CSC 474Dr. Peng Ning1 CSC 474 Information Systems Security Topic 2.3 Hash Functions.

CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.

Hashes Lesson Introduction ●The birthday paradox and length of hash ●Secure hash function ●HMAC.

Information Security and Management 11. Cryptographic Hash Functions Chih-Hung Wang Fall

Hash Algorithms Ch 12 of Cryptography and Network Security - Third Edition by William Stallings Modified from lecture slides by Lawrie Brown CIM3681 :

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

FEM Power: 1. The TestBench version of the FEM requires A for proper operation. 2. The FEM can be powered from a 6U VME crate or from a lab.

12.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 12 Cryptographic Hash Functions.

1 Message Authentication using Message Digests and the MD5 Algorithm Message authentication is important where undetected manipulation of messages can.

CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 13.Message Authentication.

Hash Algorithms.

Chapter 12 – Hash Algorithms

Secure Hash Algorithm A SEARIES OF SHA….

If the hash algorithm is properly designed and distributes the hashes uniformly over the output space, "finding a hash collision" by random guessing is.

If the hash algorithm is properly designed and distributes the hashes uniformly over the output space, "finding a hash collision" by random guessing is.

If the hash algorithm is properly designed and distributes the hashes uniformly over the output space, "finding a hash collision" by random guessing is.

MD5 A Hash Algorithm….

Verilog Implementation of SHA 256 ALGORITHM

Secured Hash Algorithm(SHA)

MD5 A Hash Algorithm….

Cryptographic Hash Functions

SHA: Secure Hash Algorithm

The Secure Hash Function (SHA)

Presentation transcript:

ECE 111 SHA-2 Algorithms

Flavors of SHA SHA-0 SHA-1 SHA-2 SHA-224 SHA-256 SHA-384 SHA-512 Longer hash value = more secure

SHA History 1993 The hash function SHA-0 was issued as a federal standard by NIST 1995 SHA-1 published as the successor to SHA-0 2002 SHA-2 variants SHA-256, SHA-384, and SHA-512 published 2004 SHA-224 published

Comparison Between SHA’s Algorithm Output size (bits) Internal state size (bits) Block size (bits) Max message size (bits) Word size (bits) Rounds Operations Collision SHA-0 160 512 264 − 1 32 80 +,and,or,xor,rotl Yes SHA-1 2^63 attack SHA- 256/224 256/224 256 64 +,and,or,xor,shr, rotr None yet SHA- 512/384 512/384 1024 2128 − 1 SHA-1 consists of 80 steps of operation Each step is also called a “round”. Usually, more rounds imply more security, and hence harder to break. In this context, “security” refers to the fact that a birthday attack [HAC] on a message digest of size n produces a collision with a workfactor of approximately 2(n/2).

SHA-256 Message is processed in 512-bit blocks sequentially, just like SHA-1 Message digest is 256 bits instead of SHA-1’s 160-bits 64 rounds instead of 80 rounds of compression Algorithm structure same as SHA-1 Step 1: Padding bits Step 2: Appending length as 64 bit unsigned Step 3: Buffer initiation Step 4: Processing of message Step 5: Output

SHA-256 Algorithm Buffer initiation: Eight 32-bit words instead of five in SHA-1 H0 = 0x6a09e667 H1 = 0xbb67ae85 H2 = 0x3c6ef372 H3 = 0xa54ff53a H4 = 0x510e527f H5 = 0x9b05688c H6 = 0x1f83d9ab H7 = 0x5be0cd19

SHA-256 Algorithm Kt constants K [0..63] = 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2

SHA-256 Algorithm Each step t (0 ≤ t ≤ 63): Word expansion for Wt If t < 16 Wt = tth 32-bit word of Mj If 16 ≤ t ≤ 63 S0 = (Wt-15 rightrotate 7)  (Wt-15 rightrotate 18)  (Wt-15 rightshift 3) S1 = (Wt-2 rightrotate 17)  (Wt-2 rightrotate 19)  (Wt-2 rightshift 10) Wt = Wt-16 + S0 + Wt-7 + S1

SHA-256 Algorithm Each step t (0 ≤ t ≤ 63): S0 = (A rightrotate 2)  (A rightrotate 13)  (A rightrotate 22) maj = (A ^ B)  (A ^ B)  (B ^ C) t2 = S0 + maj S1 = (E rightrotate 6)  (E rightrotate 11)  (E rightrotate 25) ch = (E ^ F)  (( E) ^ G) t1 = H + S1 + ch + Kt + Wt (A, B, C, D, E, F, G, H) = (t1 + t2, A, B, C, D + t1, E, F, G)

SHA-256 Algorithm Finally, when all 64 steps have been processed, set H0 = H0 + A H1 = H1 + B H2 = H2 + C H3 = H3 + D H4 = H4 + E H5 = H5 + F H6 = H6 + G H7 = H7 + H When all Mj have been processed, the 256-bit hash of M is available in H0, H1, H2, H3, H4, H5, H6, and H7

SHA-512 SHA-512 is identical in structure, but: all numbers are 64 bits long, there are 80 rounds instead of 64, the initial values and additive constants are extended to 64 bits, and the shift and rotate amounts used are different.

More Information Here is the Wikipedia page. http://en.wikipedia.org/wiki/SHA-2