CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.

Slides:



Advertisements
Similar presentations
CMSC 414 Computer and Network Security Lecture 4 Jonathan Katz.
Advertisements

CMSC 414 Computer (and Network) Security Lecture 4 Jonathan Katz.
1 Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell.
Week 2 - Friday.  What did we talk about last time?  Substitution ciphers  Vigenère ciphers  One-time pad.
Lecture 3.3: Public Key Cryptography III CS 436/636/736 Spring 2012 Nitesh Saxena.
Web Security for Network and System Administrators1 Chapter 4 Encryption.
Introduction to Cryptography and Security Mechanisms: Unit 5 Theoretical v Practical Security Dr Keith Martin McCrea
CMSC 414 Computer (and Network) Security Lecture 5 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 4 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.
CMSC 414 Computer (and Network) Security Lecture 2 Jonathan Katz.
CMSC 456 Introduction to Cryptography
CMSC 414 Computer and Network Security Lecture 5 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 4 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 9 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.
Introduction to Symmetric Block Cipher Jing Deng Based on Prof. Rick Han’s Lecture Slides Dr. Andreas Steffen’s Security Tutorial.
CMSC 414 Computer and Network Security Lecture 4 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 7 Jonathan Katz.
CS426Fall 2010/Lecture 21 Computer Security CS 426 Lecture 2 Cryptography: Terminology & Classic Ciphers.
Lecture 23 Symmetric Encryption
CS555Spring 2012/Topic 41 Cryptography CS 555 Topic 4: Computational Approach to Cryptography.
CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 5 Jonathan Katz.
Computer Security CS 426 Lecture 3
Network Security Chapter
L1.1. An Introduction to Classical Cryptosystems Rocky K. C. Chang, February 2013.
Encryption. Introduction Computer security is the prevention of or protection against –access to information by unauthorized recipients –intentional but.
3.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Traditional Symmetric-Key Ciphers.
CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.
Cryptography Week-6.
Cryptography Lecture 8 Stefan Dziembowski
CIS 5371 Cryptography Introduction.
CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.
Week 2 - Wednesday.  What did we talk about last time?  Encryption  Shift ciphers  Transposition ciphers.
Chapter 1 Introduction Cryptography-Principles and Practice Harbin Institute of Technology School of Computer Science and Technology Zhijun Li
13-1 Last time Security in Networks Network Security Controls Firewalls Honeypots Intrusion Detection Systems.
CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.
Public Key Encryption and the RSA Public Key Algorithm CSCI 5857: Encoding and Encryption.
Lec. 5 : History of Cryptologic Research II
Based on Applied Cryptography by Schneier Chapter 1: Foundations Dulal C. Kar.
Network Security Section 1: Introduction to security.
CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Classical Cryptography.
Lecture 4: Using Block Ciphers
Network Security Lecture 11 Presented by: Dr. Munam Ali Shah.
Symmetric-Key Cryptography
Network Security Lecture 10 Presented by: Dr. Munam Ali Shah.
Cryptography Lynn Ackler Southern Oregon University.
Cryptography Part 1: Classical Ciphers Jerzy Wojdyło May 4, 2001.
Classical Crypto By: Luong-Sorin VA, IMIT Dith Nimol, IMIT.
CMSC 414 Computer and Network Security Lecture 5 Jonathan Katz.
Traditional Symmetric-Key Ciphers
Lecture 23 Symmetric Encryption
Symmetric Encryption Lesson Introduction ●Block cipher primitives ●DES ●AES ●Encrypting large message ●Message integrity.
CS555Spring 2012/Topic 31 Cryptography CS 555 Topic 3: One-time Pad and Perfect Secrecy.
CS555Spring 2012/Topic 71 Cryptography CS 555 Topic 7: Stream Ciphers and CPA Security.
1 CIS 5371 Cryptography 1.Introduction. 2 Prerequisites for this course  Basic Mathematics, in particular Number Theory  Basic Probability Theory 
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
@Yuan Xue CS 285 Network Security Block Cipher Principle Fall 2012 Yuan Xue.
CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.
1 CIS 5371 Cryptography 1.Introduction. 2 Prerequisites for this course  Basic Mathematics, in particular Number Theory  Basic Probability Theory 
หัวข้อบรรยาย Stream cipher RC4 WEP (in)security LFSR CSS (in)security.
CMSC 414 Computer (and Network) Security Lecture 3 Jonathan Katz.
Symmetric-Key Cryptography CS 161: Computer Security Prof. Raluca Ada Popa Sept 13, 2016.
Cryptography Lecture 12.
CMSC 414 Computer and Network Security Lecture 3
Cryptography Lecture 11.
Presentation transcript:

CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz

Private-key encryption  Alice and Bob share a key K –Must be shared securely –Must be completely random –Must be kept completely secret from attacker –We don’t discuss (for now) how they do this  Plaintext - encryption - ciphertext - decryption  Decryption must recover the message!

Security through obscurity?  Always assume full details of crypto protocols and algorithms are public –Only secret information is a key  “Security through obscurity” is a bad idea…

Shift cipher  Attacks? –Key space is too small! –Insecure against ciphertext-only attack Frequency analysis Index of coincidence –If an attacker can recover the key, a scheme is clearly insecure What about the converse? –Multiple other attacks and problems

Substitution cipher  Attacks? –Much larger key space –Definitely not secure against known-plaintext attack –Also not secure against ciphertext-only attack (frequency analysis, digrams, trial and error) –Having a large key space is necessary, but not sufficient, to guarantee security… (Note that adversary can still recover the key)

Attacks…  A typical standard is security against chosen-plaintext attacks  Security against chosen-ciphertext attacks is increasingly required  Note that the one-time pad is insecure against known-plaintext attack

Moral of the story?  Don’t use “simple” schemes  Thoroughly analyze schemes before using –Better yet, use schemes that other, smarter people have already analyzed…  A good definition of security is critical

Re-thinking the problem  What do we mean by security? –I.e., not being able to determine the key?? –Types of attacks  Perfect security –One-time pad  Computational security –Block ciphers and modes of encryption –DES and AES

Notions of Security  What constitutes a “break”?  What kind of attacks?  Note: always assume adversary knows full details of the scheme (except the key…) –Never aim for “security through obscurity”

Security goals?  Adversary unable to recover the key –Necessary, but meaningless on its own…  Adversary unable to recover entire plaintext –Good, but is it enough?  Adversary unable to determine any information at all about the plaintext –Sounds great! –Can we achieve it?

One-time pad  (One-time pad)

Properties of one-time pad?  Achieves perfect secrecy –No eavesdropper (no matter how powerful) can determine any information whatsoever about the plaintext  (Essentially) useless in practice… –Long key length –Can only be used once (hence the name!)