Encryption with Keys and Passwords

Slides:



Advertisements
Similar presentations
Cryptography encryption authentication digital signatures
Advertisements

Creating Secret Messages. 2 Why do we need to keep things secret? Historically, secret messages were used in wars and battles For example, the Enigma.
CC3.12 Erdal KOSE Privacy & Digital Security Encryption.
Security Module – Part 1 Spring 2006 V.T. Raja, Ph.D., Oregon State University.
Encryption. Introduction Computer security is the prevention of or protection against –access to information by unauthorized recipients –intentional but.
Chapter 12 Cryptography (slides edited by Erin Chambers)
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.
Fmdszqujpo! Encryption!. Encryption  Group Activity 1:  Take the message you were given, and create your own encryption.  You can encrypt it anyway.
Cryptanalysis. The Speaker  Chuck Easttom  
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.
Cryptography Programming Lab
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.
CS110: Computers and the Internet Encryption and Certificates.
Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:
Chapter 17 Security. Information Systems Cryptography Key Exchange Protocols Password Combinatorics Other Security Issues 12-2.
Dr. Susan Al Naqshbandi The word “Cryptography” is derived from Greek words κρυπτός kryptós meaning “hidden” and γράφω gráfo meaning.
Copyright 1999 S.D. Personick. All Rights Reserved. Telecommunications Networking II Lecture 41b Cryptography and Its Applications.
CRYPTOGRAPHY. WHAT IS PUBLIC-KEY ENCRYPTION? Encryption is the key to information security The main idea- by using only public information, a sender can.
Encryption CS110: Computer Science and the Internet.
Intro to Cryptography Lesson Introduction
INCS 741: Cryptography Overview and Basic Concepts.
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.
CS201 Tech-Talk Two: Cryptography Michael Hsu CSULA.
Lecture 3 Page 1 CS 236 Online Basic Encryption Methods Substitutions –Monoalphabetic –Polyalphabetic Permutations.
AP CSP: Sending Binary Messages
Public Key Cryptography
Sending Binary Messages
Lesson 2-18 AP Computer Science Principles
Sending Binary Messages
Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.
AP CSP: Sending Binary Messages with the Internet Simulator
Lesson 1-15 AP Computer Science Principles
Lesson 7: Public Key Cryptography Lesson 8: Rapid Research - Cybercrime Day 37.
Encryption.
Lesson 2-2 AP Computer Science Principles
Cryptography Much of computer security is about keeping secrets
Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.
Cryptography Why Cryptography Symmetric Encryption
Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.
Identity Theft uses of Cryptography
Cryptographic Hash Function
Basic Encryption Methods
Lesson 1-13 AP Computer Science Principles
Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.
Looping and Random Numbers
AP CSP: Bytes, File Sizes, and Text Compression
Introduction to security goals and usage of cryptographic algorithms
Networks Encryption.
Lesson 4-5 AP Computer Science Principles
Sending Bits on the Internet
M3: Encryption r By Andrew Stringer.
Lesson 5: Simple Encryption
Cryptography Survey.
Public Key Cryptography
Chapter 3:Cryptography (16M)
Security through Encryption
PART VII Security.
Encryption with Keys and Passwords
Lesson Objectives Aims You should know about: 1.3.1:
Encryption and Decryption
Security.
Cryptography Survey.
Cryptography “The Secret Code Language”
Simple Encryption- Lesson 5
Encryption with Keys and Passwords
Lesson 7: Simple Encryption
Digital Communications
10/7/2019 Created by Omeed Mustafa 1 st Semester M.Sc (Computer Science department) Cyber-Security.
Presentation transcript:

Encryption with Keys and Passwords Lesson 4-6 AP Computer Science Principles

Objectives Students will be able to: Explain the relationship between cryptographic keys and passwords. Explain in broad terms what makes a key difficult to “crack.” Reason about strong vs. weak passwords using a tool that shows password strength. Understand that exponential growth is related to an encryption algorithm’s strength. Explain how and why the Vigenère cipher is a stronger form of encryption than plain substitution. Explain properties that make for a good key when using the Vigenère Cipher.

Cracking the Code In the previous lesson you saw how easy it was to crack a Caesar cipher with a computational tool. Today we’ll try to crack a different code to see what it’s like.

Cracking the Code Beforehand, however, we should consider why someone might want to crack a cipher in the first place. Are there ethical reasons to try to crack secret codes?

Cracking the Code Today, we will attempt to crack codes, paying particular attention to the processes and algorithms that we use to do so.

Cracking the Code So, before starting today we want to make sure that we distinguish between an encryption algorithm and an encryption key An Encryption algorithm is some method of doing encryption. The Encryption key is a specific input that dictates how to apply the method and can also be used to decrypt the message. Some people might say “What is the key to unlocking this message?”

Cracking the Code For example: The Caesar Cipher is an encryption algorithm that involves shifting the alphabet The amount of alphabetic shift used to encode the message is the key When you are cracking the Caesar Cipher you are trying to figure out how much the alphabet was shifted - you are trying to discover the key.

Cracking the Code If random substitution is an algorithm for encryption, what is the key to a random substitution cipher?

Cracking the Code So, There is a difference between the algorithm (how to execute the encryption and decryption) and key (the secret piece of information). In encryption you should always assume that your ‘enemy’ knows the encryption algorithm and has access to the same tools that you do. What makes encryption REALLY strong is making it hard to guess or crack the “key,” even if the “enemy” knows the encryption technique you’re using. Today we’ll learn a little more about it and about keys and their relationship to passwords you use every day.

Activity Today you will get back into the frequency analysis tool and try to crack a random substitution cipher with a friend. You’ll also learn about a new encryption technique that is much stronger than random substitution.

Activity Guide Exploring the Vigenère Cipher The Vigenère cipher is a method of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword. In other words it is the simple Caesar cipher but the cipher changes for each letter! The rules of letter frequency no longer apply!

Stage 6 Begin Stage 6 and complete Step 2.

Cracking the Code From what you’ve seen what are the properties of the Vigenère Cipher that make it harder to crack? In other words, if you had to crack a Vigenère cipher what would you do?

Ciphers For a long time, the Vigenère cipher was considered to be an unbreakable cipher and was used by governments to send important messages. But in the 1800s Vigenère was discovered to be susceptible to a modified form of frequency analysis. After that point it was considered insecure. Still the properties of Vigenère that we’ve found are desirable.

Computationally Hard Problems We know that a good encryption algorithm reduces the problem of cracking it to simply guessing the key. We want the key to be Computationally Hard to guess - in other words, hard for a computer to guess. Computationally Hard typically means that arriving at the solution would take a computer a prohibitively long time - as in: centuries or eons.

Computationally Hard Problems In terms of cracking encryption that means that the number of possible keys must be so large, that even a computer trying billions of possible keys per second is unlikely to arrive at the correct key in a reasonable amount of time. Nowadays when you use a password for a website or device, your password is used as a cryptographic key. So, choosing a good password is meaningful because we want the key to be hard for a computer to guess. How good is your password?…

Stage 6 Begin Stage 6 and complete Step 3.

Before the Vignere cipher was cracked, many governments openly used it Before the Vignere cipher was cracked, many governments openly used it. That is, they made no secret about the fact that they were using the Viginere cipher - it was publicly known. In the modern day, it remains the case that most encryption techniques are publicly known. Prompt: Why might it actually be a good thing that encryption algorithms are freely shared, so that anyone who wishes can try to crack them?

Video

Cracking the Code We’re circling in on some powerful ideas of how secure communication works on the Internet these days. But we need to learn two more things: We’ve seen how keys relate to the strength of encryption, but we haven’t seen the other side of it – how modern encryption algorithms actually work. Vigenère was cracked, so what are we using now? In order to do this, we need to understand what kinds of problems are “hard” for computers to solve.

Cracking the Code Right now, the only encryption we know uses a “symmetric key” – both sender and receiver need to know the secret key, and so they need to meet ahead of time. But is it possible for you and me to have a secure, private, encrypted exchange without meeting ahead of time and agreeing on a secret password??? The answer is “yes,” and we’ll find out how it works in the next lesson.

Stage 6 Complete Stage 6