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

Slides:

Advertisements

Similar presentations

Lecture 7 Overview. Advanced Encryption Standard 10, 12, 14 rounds for 128, 192, 256 bit keys – Regular Rounds (9, 11, 13) – Final Round is different.

Advertisements

Chap. 5: Advanced Encryption Standard (AES) Jen-Chang Liu, 2005 Adapted from lecture slides by Lawrie Brown.

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

Hashing Algorithms: SHA-3 CSCI 5857: Encoding and Encryption.

Cryptography and Network Security Chapter 12 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.

SMUCSE 5349/49 Message Authentication MAC and Hash.

PIITMadhumita Chatterjee Security 1 Hashes and Message Digests.

HASH ALGORITHMS - Chapter 12

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 Chapter 12

Cryptography and Network Security Hash Algorithms.

Cryptography and Network Security (CS435) Part Ten (Hash and MAC algorithms)

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.

Information Security and Management 11

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

Cryptography and Network Security Chapter 12 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.

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

Authentication & digital signature Jen-Chang Liu Adapted from lecture slides by Lawrie Brown.

Lecture 23 Symmetric Encryption

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)

Network Security Essentials Fifth Edition by William Stallings Fifth Edition by William Stallings.

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

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.

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.

9/17/15UB Fall 2015 CSE565: S. Upadhyaya Lec 6.1 CSE565: Computer Security Lecture 6 Advanced Encryption Standard Shambhu Upadhyaya Computer Science &

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

Data & Network Security

Hash and MAC Functions CS427 – Computer Security

Computer Security: Principles and Practice First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown Chapter 2 – Cryptographic.

Improving Encryption Algorithms Betty Huang Computer Systems Lab

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

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

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

Cryptography & Network Security: 1 IX. Hash Algorithms Look at three important hash functions (MD5, SHA-1, RIPEND-160) then look an Internet- standard.

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

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 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.

1 Chapter 12: Hash and MAC Algorithms Fourth Edition by William Stallings Lecture slides by Lawrie Brown (modified by Prof. M. Singhal, U of Kentucky)

Cryptography and Network Security

CS426Fall 2010/Lecture 51 Computer Security CS 426 Lecture 5 Cryptography: Cryptographic Hash Function.

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

IT 221: Introduction to Information Security Principles Lecture 5: Message Authentications, Hash Functions and Hash/Mac Algorithms For Educational Purposes.

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.

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.

School of Computer Science and Engineering Pusan National University

최신정보보호기술 경일대학교 사이버보안학과 김 현성.

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

SHA: Secure Hash Algorithm

The Secure Hash Function (SHA)

Digital Signature Standard (DSS)

Data Encryption Standard (DES)

Presentation transcript:

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

History of SHA SHA: secure hash algorithm Developed by National Institute of Standard and Technology (NIST) Based on the MD4 FIPS 180 in 1993 SHA-1: revised SHA, FIPS in 1995, also RFC 3174

Secure hash algorithm (SHA) SHA logic 512-bit block SHA bit digest

SHA round for 512-bit block 4 different functions: Totally 80 steps 5 個 32- bit words

Elementary SHA operation 32 bits From 512-bit input block Fixed constant Circular left shift 5 bits

SHA bitswise functions StepFunction ValueComment 0≤t≤19 If B then C else D 20≤t≤39 Parity bit of B,C, and D 40≤t≤59 2 or 3 of B,C,D is true 60≤t≤79 Parity bit of B,C, and D

W[0-79] from input 512-bit block W[0-79]

Security of SHA Against brute-force attack Produce any message having a given SHA digest is on the order of Against cryptanalysis No known attacks Speed Logic operation & addition modulo 2 32 Fast on 32-bit architecture Simple to implement

Improvement to SHA Comparison of SHA-x