CS 555Topic 11 Cryptography CS 555 Topic 1: Overview of the Course & Introduction to Encryption.

Slides:



Advertisements
Similar presentations
Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.
Advertisements

ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.
Cryptology Terminology and Early History. Cryptology Terms Cryptology –The science of concealing the meaning of messages and the discovery of the meaning.
Computer Science CSC 474By Dr. Peng Ning1 CSC 474 Information Systems Security Topic 2.1 Introduction to Cryptography.
CS 6262 Spring 02 - Lecture #7 (Tuesday, 1/29/2002) Introduction to Cryptography.
1 Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell.
Lecture 2.1: Private Key Cryptography -- I CS 436/636/736 Spring 2013 Nitesh Saxena.
Block Ciphers and the Data Encryption Standard
Chapter 5 Cryptography Protecting principals communication in systems.
CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.
McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.
Introduction to Symmetric Block Cipher Jing Deng Based on Prof. Rick Han’s Lecture Slides Dr. Andreas Steffen’s Security Tutorial.
CS470, A.SelcukIntroduction1 CS 470 Introduction to Applied Cryptography Instructor: Ali Aydin Selcuk.
Overview of Cryptography and Its Applications Dr. Monther Aldwairi New York Institute of Technology- Amman Campus INCS741: Cryptography.
CS426Fall 2010/Lecture 21 Computer Security CS 426 Lecture 2 Cryptography: Terminology & Classic Ciphers.
CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
Computer Security CS 426 Lecture 3
A Cryptography Tutorial Jim Xu College of Computing Georgia Tech
Chapter 8.  Cryptography is the science of keeping information secure in terms of confidentiality and integrity.  Cryptography is also referred to as.
Chapter 2 – Classical Encryption Techniques
CMSC 414 Computer and Network Security Lecture 3 Jonathan Katz.
Cryptography Week-6.
Chapter 2 Basic Encryption and Decryption. csci5233 computer security & integrity 2 Encryption / Decryption encrypted transmission AB plaintext ciphertext.
Cryptography Lecture 1: Introduction Piotr Faliszewski.
CIS 5371 Cryptography Introduction.
3.1 SERVICES AND MECHANISMS SERVICES AND MECHANISMS The International Telecommunication Union- Telecommunication Standardization Section (ITU-T) provides.
Introduction to Information Security Chapter II : Classical Ciphers.
Information Security Principles (ESGD4222)
Cis 4930 Introduction to cryptography
Chapter 1 Introduction Cryptography-Principles and Practice Harbin Institute of Technology School of Computer Science and Technology Zhijun Li
Chapter 2 – Elementary Cryptography  Concepts of encryption  Cryptanalysis  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public.
Cryptology By Greg Buss Pat Shields Barry Burke. What is Cryptology? Cryptology is the study of “secret writing.” Modern cryptology combines the studies.
Lec. 5 : History of Cryptologic Research II
Based on Applied Cryptography by Schneier Chapter 1: Foundations Dulal C. Kar.
CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Classical Cryptography.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Security PART VII.
1 Chapter 2-1 Conventional Encryption Message Confidentiality.
Network Security Lecture 11 Presented by: Dr. Munam Ali Shah.
30.1 Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Terminology and classical Cryptology
Elementary Cryptography  Concepts of encryption  Symmetric (secret key) Encryption (DES & AES)(DES & AES)  Asymmetric (public key) Encryption (RSA)(RSA)
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Security.
Traditional Symmetric-Key Ciphers
Computer Security Cryptography. Cryptography Now and Before  In the past – mainly used for confidentiality  Today –Still used for confidentiality –Data.
CRYPTOGRAPHY. TOPICS OF SEMINAR Introduction & Related Terms Categories and Aspects of cryptography Model of Network Security Encryption Techniques Public.
CRYPTOGRAPHY & NETWORK SECURITY Introduction and Basic Concepts Eng. Wafaa Kanakri Computer Engineering Umm Al-Qura University.
Overview of Cryptography & Its Applications
24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Security PART VII.
Welcome to Cryptology 1 st Semester – Room B310. Syllabus.
K. Salah1 Cryptography Module I. K. Salah2 Cryptographic Protocols  Messages should be transmitted to destination  Only the recipient should see it.
CRYPTOGRAPHY PRESENTED BY : NILAY JAYSWAL BRANCH : COMPUTER SCIENCE & ENGINEERING ENTRY NO. : 14BCS033 1.
1 Symmetric-Key Encryption CSE 5351: Introduction to Cryptography Reading assignment: Chapter 2 Chapter 3 (sections ) You may skip proofs, but are.
Symmetric Cipher Model Plaintext input 1- encryption algorithm 2- secret key Encryption Cipher text output Cipher text input 1- Decryption algorithm 2-
1.1 Introduction to Cryptography. 1.2 Basic Cryptography Cryptography is a deep mathematical subject. Cryptographic protocols provide a cornerstone for.
1 CIS 5371 Cryptography 1.Introduction. 2 Prerequisites for this course  Basic Mathematics, in particular Number Theory  Basic Probability Theory 
Computer Security (CS4800)
Lecture 5 Page 1 CS 236 Online More on Cryptography CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.
CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.
INCS 741: Cryptography Overview and Basic Concepts.
CHAPTER 14 ENCRYPTION AND DECRYPTION Sajina Pradhan
Computer Security By Rubel Biswas. Introduction History Terms & Definitions Symmetric and Asymmetric Attacks on Cryptosystems Outline.
Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.
1 CIS 5371 Cryptography 1.Introduction. 2 Prerequisites for this course  Basic Mathematics, in particular Number Theory  Basic Probability Theory 
CRYPTOGRAPHY Cryptography is art or science of transforming intelligible message to unintelligible and again transforming that message back to the original.
Basic of Modern Cryptography
Computer Security Chapter Two
Presentation transcript:

CS 555Topic 11 Cryptography CS 555 Topic 1: Overview of the Course & Introduction to Encryption

CS 555Topic 12 See the Course Homepage

CS 555Topic 13 Goals of Cryptography The most fundamental problem cryptography addresses: ensure security of communication over insecure medium What does secure communication mean? –confidentiality (privacy, secrecy) only the intended recipient can see the communication –integrity (authenticity) the communication is generated by the alleged sender What does insecure medium mean? –Two possibilities: Passive attacker: the adversary can eavesdrop Active attacker: the adversary has full control over the communication channel

CS 555Topic 14 Approaches to Secure Communication Steganography –“covered writing” –hides the existence of a message –depends on secrecy of method Cryptography –“hidden writing” –hide the meaning of a message –depends on secrecy of a short key, not method

Terms: Cryptography, cryptanalysis, and cryptology Cryptography, –Traditionally, designing algorithms/protocols –Nowadays, often synonym with cryptology Cryptanalysis –Breaking algorithms/protocols Cryptology: both cryptography & cryptanalysis –Becoming less common CS 555Topic 15

CS 555Topic 16 What Cryptography is About? Constructing and analyzing protocols which enables parties to achieve objectives, overcoming the influence of adversaries. –a protocol (or a scheme) is a suite of algorithms that tell each party what to do How to devise and analyze protocols –understand the threats posed by the adversaries and the goals

CS 555Topic 17 A Sample List of Other Goals in Modern Cryptography Modern cryptography covers many topics beyond secure communication –Pseudo-random number generation –Non-repudiation: Digital signatures –Zero-knowledge proof –Commitment schemes –E-voting –Secret sharing –Secure Multi-party Computation (Secure Function Evaluation) –…

CS 555Topic 18 History of Cryptography years An ongoing battle between codemakers and codebreakers Driven by communication & computation technology –paper and ink (until end of 19 th century) –cryptographic engine & telegram, radio Enigma machine, Purple machine used in WWII –computers & digital communication

Major Events in History of Cryptography Mono-alphabetical ciphers (Before 1000 AD) Frequency analysis (Before 1000 AD) Cipher machines (early 1900’s) Shannon developed theory of perfect secrecy and information theoretical security (around 1950) US adopts Data Encryption Standard in 1977 Notion of public key cryptography and digital signatures introduced (1970~1976) The study of cryptography becomes mainstream in the research community (1976) Development of computational security and other theoretical foundation of modern cryptography (1980’s) CS 555Topic 19

CS 555Topic 110 What is This Course About? Mostly mathematical –Understand the mathematics underlying the cryptographic algorithms & protocols –Understand the power and limitations of cryptographic tools –Understand the formal approach to security in modern cryptography

CS 555Topic 111 Backgrounds Necessary for the Course A bit of probability Algorithms and complexity Mathematical maturity –understand what is (and what is not) a proper definition –know how to write a proof

Symmetric-key Encryption This is what cryptography is all about until Two parties (often called a sender and a receiver) share some secret information called a key. Sender uses the key to encrypt (or “scramble”) the message, before it is sent Receiver uses the same key to decrypt (or “unscramble”) and recover the original message CS 555Topic 112

CS 555Topic 113 Basic Terminology for Encryption Plaintext –An original message –Also referred to as message Plaintext space (aka Message space) –the set consisting of all possible plaintexts Ciphertext –A scrambled message Ciphertext space –The set consisting of all possible scrambled message Key secret used in transformation Key space K

Notation for Symmetric-key Encryption A symmetric-key encryption scheme is comprised of three algorithms –Genthe key generation algorithm The algorithm must be probabilistic/randomized Output: a key k –Encthe encryption algorithm Input: key k, plaintext m Output: ciphertext c := Enc k (m) –Decthe decryption algorithm Input:key k, ciphertext c Output:plaintext m := Dec k (m) CS 555Topic 114 Requirement:  k  m [ Dec k (Enc k (m)) = m ]

CS 555Topic 115 Shift Cipher The Key Space K : –[0.. 25] Encryption given a key k: –each letter in the plaintext P is replaced with the k’th letter following corresponding number (shift right) Decryption given k: –shift left History: k = 3, Caesar ’ s cipher

CS 555Topic 116 Shift Cipher: Cryptanalysis Can an attacker find K? –YES: by a bruteforce attack through exhaustive key search, How to tell whether a shift is correct? –key space is small (<= 26 possible keys). Cipher key space needs to be large enough. Exhaustive key search can be effective.

CS 555Topic 117 Mono-alphabetic Substitution Cipher The key space: all permutations of  = {A, B, C, …, Z} Encryption given a key  : –each letter X in the plaintext P is replaced with  (X) Decryption given a key  : –each letter Y in the cipherext P is replaced with  -1 (Y) Example: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z  = B A D C Z H W Y G O Q X S V T R N M L K J I P F E U BECAUSE  AZDBJSZ

CS 555Topic 118 Strength of the Mono-alphabetic Substitution Cipher Exhaustive search is difficult –key space size is 26!  4×10 26  2 88 Dominates the art of secret writing throughout the first millennium A.D. Thought to be unbreakable by many back then How to break it?

CS 555Topic 119 Cryptanalysis of Substitution Ciphers: Frequency Analysis Basic ideas: –Each language has certain features: frequency of letters, or of groups of two or more letters. –Substitution ciphers preserve the language features. History of frequency analysis –Discovered by the Arabs; earliest known description is in a book by the ninth-century scientist al-Kindi –Rediscovered or introduced from the Arabs in the Europe during the Renaissance Frequency analysis made substitution cipher insecure

CS 555Topic 120 Frequency of Letters in English

How to Defeat Frequency Analysis? Use larger blocks as the basis of substitution. Rather than substituting one letter at a time, substitute 64 bits at a time, or 128 bits. –Leads to block ciphers such as DES & AES. Use different substitutions to get rid of frequency features. –Leads to polyalphabetical substituion ciphers, cipher machines, and stream ciphers CS 555Topic 121

CS 555Topic 122 Coming Attractions … Vigenere cipher. Required reading –Katz and Lindell: 1.1 to 1.3 Recommended reading –The Code Book: Chapters 1 to 4