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.

Slides:

Advertisements

Similar presentations

Hashes and Message Digests

Advertisements

1 Key Exchange Solutions Diffie-Hellman Protocol Needham Schroeder Protocol X.509 Certification.

Public Key Cryptosystem

Spring 2000CS 4611 Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.

Digital Signatures and Hash Functions. Digital Signatures.

Authentication and Digital Signatures CSCI 5857: Encoding and Encryption.

Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.

EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 6 Wenbing Zhao Department of Electrical and Computer Engineering.

Network Security – Part 2 Public Key Cryptography Spring 2007 V.T. Raja, Ph.D., Oregon State University.

Security Chapters 14,15. The Security Environment Threats Security goals and threats.

CNS2010handout 10 :: digital signatures1 computer and network security matt barrie.

ECOMMERCE TECHNOLOGY SUMMER 2002 COPYRIGHT © 2002 MICHAEL I. SHAMOS Cryptographic Security.

Dr Alejandra Flores-Mosri Message Authentication Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to:

ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.

Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.

Announcements: 1. HW6 due now 2. HW7 posted Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs, Diffie-Hellman, ElGamal Hash Functions.

Secure Hashing and DSS Sultan Almuhammadi ICS 454 Principles of Cryptography.

Introduction to Signcryption November 22, /11/2004 Signcryption Public Key (PK) Cryptography Discovering Public Key (PK) cryptography has made.

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

Network Security – Part 2 V.T. Raja, Ph.D., Oregon State University.

8: Network Security8-1 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key: K r e.g., key is knowing substitution.

Overview of Digital Signatures Introduction To Networks and Communications (CS 555) Presented by Bharath Kongara.

J. Wang. Computer Network Security Theory and Practice. Springer 2008 Chapter 4 Data Authentication Part II.

Network Security Chapter Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011.

David Froot.  How do we transmit information and data, especially over the internet, in a way that is secure and unreadable by anyone but the sender.

Information Security and Management 13. Digital Signatures and Authentication Protocols Chih-Hung Wang Fall

Public Key Cryptography July Topics  Symmetric and Asymmetric Cryptography  Public Key Cryptography  Digital Signatures  Digital Certificates.

16.2 Digital Signatures By: John Barton. What is a Digital Signature? The idea comes from the idea of signing a document by its author (authenticating.

Bob can sign a message using a digital signature generation algorithm

Lecture 15 Lecture’s outline Public algorithms (usually) that are each other’s inverse.

AQA Computing A2 © Nelson Thornes 2009 Section Unit 3 Section 6.4: Internet Security Digital Signatures and Certificates.

8-1Network Security Chapter 8 roadmap 8.1 What is network security? 8.2 Principles of cryptography 8.3 Message integrity, authentication.

Network Security – Part 2 (Continued) Lecture Notes for May 8, 2006 V.T. Raja, Ph.D., Oregon State University.

Cryptography, Authentication and Digital Signatures

4 th lecture.  Message to be encrypted: HELLO  Key: XMCKL H E L L O message 7 (H) 4 (E) 11 (L) 11 (L) 14 (O) message + 23 (X) 12 (M) 2 (C) 10 (K) 11.

Introduction1-1 Data Communications and Computer Networks Chapter 6 CS 3830 Lecture 31 Omar Meqdadi Department of Computer Science and Software Engineering.

Public Key Encryption CS432 – Security in Computing Copyright © 2005, 2008 by Scott Orr and the Trustees of Indiana University.

Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!

Network Security7-1 CIS3360: Chapter 8: Cryptography Application of Public Cryptography Cliff Zou Spring 2012 TexPoint fonts used in EMF. Read the TexPoint.

CSCI 172/283 Fall 2010 Hash Functions, HMACs, and Digital Signatures.

Encryption. What is Encryption? Encryption is the process of converting plain text into cipher text, with the goal of making the text unreadable.

Lecture 8 Overview. Secure Hash Algorithm (SHA) SHA SHA SHA – SHA-224, SHA-256, SHA-384, SHA-512 SHA-1 A message composed of b bits.

Advanced Database Course (ESED5204) Eng. Hanan Alyazji University of Palestine Software Engineering Department.

8-1 Chapter 8 Security Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 part 2: Message integrity.

Digital Signatures, Message Digest and Authentication Week-9.

Cryptographic Hash Functions and Protocol Analysis

Lecture 2: Introduction to Cryptography

CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Modern Cryptography.

A A E E D D C C B B # Symmetric Keys = n*(n-1)/2 F F

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.

Group 9 Chapter 8.3 – 8.6. Public Key Algorithms  Symmetric Key Algorithms face an inherent problem  Keys must be distributed to all parties but kept.

Computer Science and Engineering Computer System Security CSE 5339/7339 Lecture 11 September 23, 2004.

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.

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

Cryptographic Security Aveek Chakraborty CS5204 – Operating Systems1.

Secure Instant Messenger in Android Name: Shamik Roy Chowdhury.

Cryptography Hyunsung Kim, PhD University of Malawi, Chancellor College Kyungil University February, 2016.

Security. Security Needs Computers and data are used by the authorized persons Computers and their accessories, data, and information are available to.

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.

DTTF/NB479: Dszquphsbqiz Day 26

Computer Communication & Networks

Cryptographic Hash Function

Basic Network Encryption

ICS 454 Principles of Cryptography

ICS 454 Principles of Cryptography

Chapter 3 - Public-Key Cryptography & Authentication

Basic Network Encryption

Chapter 8 roadmap 8.1 What is network security?

Presentation transcript:

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 times, you should get the same answer – if not then the data has been modified.

Properties of a hash function A hash function h acts on data x and returns a value h(x). The hash function should have these 4 essential properties: 1.Given x it should be easy to compute h(x). 2.The input x can be of arbitrary length. 3.Given a value y, it should be hard to find an x such that h(x) = y. 4.It is hard to find two different inputs x 1 and x 2 such that h(x 1 ) = h(x 2 ).

Why are these important? 1.To make computations fast and efficient. 2.So that any message can be hashed. 3.To prevent a message being replaced with another with the same hash value. 4.To prevent the sender claiming to have sent x 2 when in fact the message was x 1.

The Secure Hash Algorithm SHA-1 1.Arbitrary length input is divided into blocks of 512 bits. The last block is padded to make 448 bits and the rest of the block is used to give the length of the input before padding. 2.Each 512 bit block is split into bit words denoted by w(0), w(1),….,w(15). 3.These are expanded into 80 words w(0),…,w(79)

4.Initially 5 32-bit words h 0,….,h 4 are given particular values. 5.For each 512-bit block, SHA-1 operates on w(0),…..,w(79) and h 0,….,h 4 using shifts, bitstring operations (and, or) and modular arithmetic mod 2 32 to produce new values of h 0,….,h 4. 6.These new value of h 0,….,h 4 form the initial data for the next block which is expanded and operated on as above to produce the next values of h 0,….,h 4.

7.This process of generating new values of h 0,….,h 4 continues until all of the 512 bit blocks has been processed. 8.The final set of values h 0,….,h 4 are then concatenated to form a 160 bit value which is the output of the hash function.

SHA-1 and digital signatures Instead of sending and signing a message m, Bob can hash m to get SHA(m) and then encrypt SHA(m) using his private key to get a signature s. Bob then sends the pair (m,s) to Alice. On receiving the message, Alice –decrypts s using Bobs public key –hashes m to get SHA(m) If these two values are the same then the message is authenticated.

SHA-1 and Certificates X.509 Standard Bob generates a document containing his relevant information and presents himself with this document to the CA. The CA confirm Bobs identity. The CA hash the document using SHA-1 and encrypt it using their own private key. This is the certificate.

If Alice wants to communicate with Bob she looks up his public key document and certificate. She will use the public key of the CA to decrypt the certificate. She will hash the document using SHA-1 If these two items are the same then she knows that she can safely communicate with Bob using the public key since the CA has verified his identity.