Copyright 1999 S.D. Personick. All Rights Reserved. Telecommunications Networking II Lecture 41b Cryptography and Its Applications.

Slides:

Advertisements

Similar presentations

Key Management Nick Feamster CS 6262 Spring 2009.

Advertisements

1 Network Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls.

Sri Lanka Institute of Information Technology

Digital Signatures and Hash Functions. Digital Signatures.

1 Supplement III: Security Controls What security services should network systems provide? Confidentiality Access Control Integrity Non-repudiation Authentication.

Information Security Principles & Applications Topic 4: Message Authentication 虞慧群

1 Digital Signatures & Authentication Protocols. 2 Digital Signatures have looked at message authentication –but does not address issues of lack of trust.

1 Authentication Applications Digital Signatures Security Concerns X.509 Authentication Service Kerberos Based on slides by Dr. Lawrie Brown of the Australian.

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

Dr. Lo’ai Tawalbeh Summer 2007 Chapter 9 – Public Key Cryptography and RSA Dr. Lo’ai Tawalbeh New York Institute of Technology (NYIT) Jordan’s Campus INCS.

Feb 25, 2003Mårten Trolin1 Previous lecture More on hash functions Digital signatures Message Authentication Codes Padding.

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

Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.

Key Management public-key encryption helps address key distribution problems have two aspects of this: –distribution of public keys –use of public-key.

8-1 What is network security? Confidentiality: only sender, intended receiver should “understand” message contents m sender encrypts message m receiver.

Cryptographic Technologies

Mar 5, 2002Mårten Trolin1 Previous lecture More on hash functions Digital signatures Message Authentication Codes Padding.

Presented by Xiaoping Yu Cryptography and PKI Cosc 513 Operating System Presentation Presented to Dr. Mort Anvari.

Cryptography1 CPSC 3730 Cryptography Chapter 9 Public Key Cryptography and RSA.

Chapter3 Public-Key Cryptography and Message Authentication.

August 6, 2003 Security Systems for Distributed Models in Ptolemy II Rakesh Reddy Carnegie Mellon University Motivation.

Cryptography and Network Security Chapter 10. Chapter 10 – Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture.

E- Business Digital Signature Varna Free University Prof. Teodora Bakardjieva.

ASYMMETRIC CIPHERS.

Digital Signature Xiaoyan Guo/ Xiaohang Luo/

Introduction to Public Key Cryptography

1 Cryptography Cryptography is a collection of mathematical techniques to ensure confidentiality of information Cryptography is a collection of mathematical.

1 Public-Key Cryptography and Message Authentication Ola Flygt Växjö University, Sweden

Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.

Pretty Good Privacy by Philip Zimmerman presented by: Chris Ward.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Network Security (A Very Brief Introduction)

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.

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

Network Security. Cryptography Cryptography functions Secret key (e.g., DES) Public key (e.g., RSA) Message digest (e.g., MD5) Security services Privacy:

1 Chapter 11: Message Authentication and Hash Functions Fourth Edition by William Stallings Lecture slides by Lawrie Brown (modified by Prof. M. Singhal,

Cryptography, Authentication and Digital Signatures

©The McGraw-Hill Companies, Inc., 2000© Adapted for use at JMU by Mohamed Aboutabl, 2003Mohamed Aboutabl1 1 Chapter 29 Internet Security.

Chapter 17 Security. Information Systems Cryptography Key Exchange Protocols Password Combinatorics Other Security Issues 12-2.

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.

1 Securing Data and Communication. 2 Module - Securing Data and Communication ♦ Overview Data and communication over public networks like Internet can.

1 Public-Key Cryptography and Message Authentication.

Computer and Network Security Rabie A. Ramadan Lecture 6.

Chapter 16 Security Introduction to CS 1 st Semester, 2012 Sanghyun Park.

Cryptography and Network Security Chapter 9 - Public-Key Cryptography

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

Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.

Lecture 16: Security CDK4: Chapter 7 CDK5: Chapter 11 TvS: Chapter 9.

CS 4244: Internet Programming Security 1.0. Introduction Client identification and cookies Basic Authentication Digest Authentication Secure HTTP.

Chapter 3 – Public Key Cryptography and RSA (A). Private-Key Cryptography traditional private/secret/single-key cryptography uses one key shared by both.

1 Chapter 10: Key Management in Public key cryptosystems Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Modified by Prof. M. Singhal,

Encryption Basics Module 7 Section 2. History of Encryption Secret - NSA National Security Agency –has powerful computers - break codes –monitors all.

Electronic Commerce School of Library and Information Science PGP and cryptography I. What is encryption? Cryptographic systems II. What is PGP? How does.

Key Management Network Systems Security Mort Anvari.

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

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

Lecture 11 Overview. Digital Signature Properties CS 450/650 Lecture 11: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.

April 20023CSG11 Electronic Commerce Encryption John Wordsworth Department of Computer Science The University of Reading Room.

Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.

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

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

Fall 2006CS 395: Computer Security1 Key Management.

Security By Meenal Mandalia. What is ? stands for Electronic Mail. much the same as a letter, only that it is exchanged in a different.

INCS 741: Cryptography Overview and Basic Concepts.

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.

Cryptographic Hash Function

CDK4: Chapter 7 CDK5: Chapter 11 TvS: Chapter 9

The Secure Sockets Layer (SSL) Protocol

CDK: Chapter 7 TvS: Chapter 9

Chapter -7 CRYPTOGRAPHIC HASH FUNCTIONS

Presentation transcript:

Copyright 1999 S.D. Personick. All Rights Reserved. Telecommunications Networking II Lecture 41b Cryptography and Its Applications

Copyright 1999 S.D. Personick. All Rights Reserved. Basic Cryptography

Copyright 1999 S.D. Personick. All Rights Reserved. Cryptography Using mathematically-based methods to protect information from being read and/or modified by unauthorized persons

Copyright 1999 S.D. Personick. All Rights Reserved. The concept of a cipher Four score and seven years ago … Gpvs tdpsf boe tfwfo zfbst bhp...

Copyright 1999 S.D. Personick. All Rights Reserved. Cryptography The simple substitution cipher is easy to “break” We need a much more secure approach for real-world applications

Copyright 1999 S.D. Personick. All Rights Reserved. Cryptography The most secure approach to cryptography is to use a “one time pad”… However, in most applications it is not practical to use the “one time pad” method

Copyright 1999 S.D. Personick. All Rights Reserved. Cryptography Most cryptographic methods are based on -A cryptographic algorithm that is assumed to be widely known (the algorithm itself is not secret) -A secret cryptographic “key” that is known only to those who are authorized to have the secret key

Copyright 1999 S.D. Personick. All Rights Reserved. Cryptography EncrpytDecrpyt Secret Key

Copyright 1999 S.D. Personick. All Rights Reserved. Desired Properties of an Encryption Algorithm It should be very difficult (computationally) to decrypt a message without having the secret key It should be reasonably easy to encrypt and decrypt a message, if you have the secret key

Copyright 1999 S.D. Personick. All Rights Reserved. Details The secret key is usually a binary sequence (1s and 0s) that is at least 56 bits long, and preferably 128 bits long (or longer) Key management... E.g., distributing secret keys to people who are authorized to have them, without making them accessible to unauthorized persons … is always a challenge

Copyright 1999 S.D. Personick. All Rights Reserved. Details Nobody knows for sure how “hard” it is to “break” modern encryption methods … however mathematicians are able to make statements about the comparative difficulty of breaking one method vs. another Increasing computing power makes brute force methods feasible… leading to the need for longer keys

Copyright 1999 S.D. Personick. All Rights Reserved. Details The ability to break many encryption methods is closely related to the ability to “factor” a large number … thus you may read about competitions among people working in the field of cryptography to come up with efficient computational schemes for factoring large numbers

Copyright 1999 S.D. Personick. All Rights Reserved. Public-key Cryptography In the 1970’s cryptographic researchers came up with some amazing results/concepts that have had a remarkable impact on the ability to build practical cryptographic systems These results/concepts helped address the key management problem

Copyright 1999 S.D. Personick. All Rights Reserved. The concept of a 1-way function A one-way function is one for which it is easy to compute y = f(x), where y and x are sequences of binary digits (1s and 0s) … … but it is very “hard” to compute what x is, given that you have access to y A one way function is analogous to a padlock: I can easily snap it shut, but I can’t open it (without a key or a combination)

Copyright 1999 S.D. Personick. All Rights Reserved. The Concept of Public-key Cryptography Public key encryption EncrpytDecrpyt Public Key Private (secret) Key

Copyright 1999 S.D. Personick. All Rights Reserved. The Concept of Public Key Encryption A public key is a sequence of binary digits (1s and 0s) that is accessible to anyone who wishes to know what it is (I.e., its published in a publicly accessible directory) The corresponding private (secret) key is only known to authorized persons

Copyright 1999 S.D. Personick. All Rights Reserved. The Concept of Public Key Encryption A public key is used to apply a one-way function, I.e. to encrypt the red information. Anyone with a message to send to a particular recipient, or set of recipients can use the recipient’s public key to do this The corresponding private (secret) key is used by the authorized recipient(s) to decrypt messages that have been sent to them

Copyright 1999 S.D. Personick. All Rights Reserved. Details It is computationally difficult (and correspondingly slow) to utilize public key cryptography Therefore, in practice, public key cryptography is often used as a secure method for exchanging private keys; and then private key cryptography is used to exchange information

Copyright 1999 S.D. Personick. All Rights Reserved. A key exchange protocol Client Server Obtain server’s public key Use server’s public key to send ID info to server Receive/decrypt session key Use session key Receive/decrypt message Obtain client’s public key Send session key to client - Use session key

Copyright 1999 S.D. Personick. All Rights Reserved. Digital Signatures Problem -How can I be sure that a message with your name associated with it: really came from you hasn’t been altered since you sent it

Copyright 1999 S.D. Personick. All Rights Reserved. Digital Signatures Message HashSignature Encrypt Sender’s private key

Copyright 1999 S.D. Personick. All Rights Reserved. Digital Signatures The hash is a summary of my message Given the message, anyone can compute the hash When I encrypt the hash and my signature, using my secret key, anyone can decrypt it using my public key

Copyright 1999 S.D. Personick. All Rights Reserved. Digital Signatures However, no one can change the message without producing a mismatch between the hash derived from the changed message, and the hash that I sent in my encrypted hash/signature file Furthermore, no one can create a fake hash/ signature file that will decrypt properly with my public key

Copyright 1999 S.D. Personick. All Rights Reserved. Certificates When I send you a message claiming to be Prof. Stewart Personick of Drexel University, encrypted with my private key, and it decrypts properly with my public key …how do you know that the public key you obtained from the public key directory really belongs to Prof. Stewart Personick of Drexel University? Who certifies this?

Copyright 1999 S.D. Personick. All Rights Reserved. Certificate Authority A well known/trusted “certificate authority” can provide me with an electronically signed certificate (encrypted with the certificate authority’s private key) vouching for the fact that a particular public key has, in fact, been issued to Professor Stewart Personick of Drexel University One can create a hierarchy of certificate authorities