Encryption Encryption encodes information to hide it from everyone else … maintaining your privacy.

Slides:

Advertisements

Similar presentations

Digital Signatures. Anononymity and the Internet.

Advertisements

Section 3.8: More Modular Arithmetic and Public-Key Cryptography

 Caesar used to encrypt his messages using a very simple algorithm, which could be easily decrypted if you know the key.  He would take each letter.

Primality Testing By Ho, Ching Hei Cheung, Wai Kwok.

22C:19 Discrete Math Integers and Modular Arithmetic Fall 2010 Sukumar Ghosh.

1 Counter-measures Threat Monitoring Cryptography as a security tool Encryption Digital Signature Key distribution.

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.

Cryptography 101 How is data actually secured. RSA Public Key Encryption RSA – names after the inventors –Rivest, Shamir, and Adleman Basic Idea: Your.

Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.

CC3.12 Erdal KOSE Privacy & Digital Security Encryption.

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

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

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

Cryptography (continued). Enabling Alice and Bob to Communicate Securely m m m Alice Eve Bob m.

Public Key Cryptography

McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.

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

© Copyright Martin Tompa, 1999 Secret Codes, Unforgeable Signatures, and Coin Flipping on the Phone Martin Tompa Computer Science & Engineering 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.

Computer Science Lecture 22, page 1 Security in Distributed Systems Introduction Cryptography Authentication Key exchange Readings: Tannenbaum, chapter.

Encryption. Introduction Computer security is the prevention of or protection against –access to information by unauthorized recipients –intentional but.

Codes, Ciphers, and Cryptography-RSA Encryption

Introduction to Public Key Cryptography

1 Introduction to Codes, Ciphers, and Cryptography Michael A. Karls Ball State University.

1 Fluency with Information Technology Lawrence Snyder Chapter 17 Privacy & Digital Security Encryption.

Chapter 12 Cryptography (slides edited by Erin Chambers)

Fmdszqujpo! Encryption!. Encryption  Group Activity 1:  Take the message you were given, and create your own encryption.  You can encrypt it anyway.

Page 1 Secure Communication Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.

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

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

CS110: Computers and the Internet Encryption and Certificates.

T TT The Cryptography Istituto Tecnico Industriale “E.Divini” San Severino Marche.

Encryption Coursepak little bit in chap 10 of reed.

Lawrence Snyder University of Washington, Seattle © Lawrence Snyder 2004 Computing Is Pretty Strange.

Public-Key Cryptography CS110 Fall Conventional Encryption.

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.

Section 2.1: Shift Ciphers and Modular Arithmetic Practice HW from Barr Textbook (not to hand in) p.66 # 1, 2, 3-6, 9-12, 13, 15.

Midterm Review Cryptography & Network Security

CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.

Day 37 8: Network Security8-1. 8: Network Security8-2 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key:

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

National Institute of Science & Technology Cryptology and Its Applications Akshat Mathur [1] Cryptology and Its Applications Presented By AKSHAT MATHUR.

Modular Arithmetic with Applications to Cryptography Lecture 47 Section 10.4 Wed, Apr 13, 2005.

Encryption, continued Public Key encryption and Digital Signatures.

Public-Key Encryption

RSA Public Key Crypto System. About RSA Announced in 1977 by Ronald Rivest, Adi Shamir, and Leonard Adleman Relies on the relative ease of finding large.

1 Public-Key Cryptography and Message Authentication.

Cryptography Dave Feinberg. Suppose I send an from to Who has access to that ? What if I want the.

24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,

Encryption CS110: Computer Science and the Internet.

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

Encryption on the Internet Jeff Cohen. Keeping Information Secret What information do we want to be secret? –Credit card number –Social security number.

Primality Testing. Introduction The primality test provides the probability of whether or not a large number is prime. Several theorems including Fermat’s.

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.

Elgamal Public Key Encryption CSCI 5857: Encoding and Encryption.

RSA Cryptosystem Great Theoretical Ideas In Computer Science S. Rudich V. Adamchik CS Spring 2006 Lecture 8Feb. 09, 2006Carnegie Mellon University.

Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.

Network Security  introduction  cryptography  authentication  key exchange  required reading: text section 7.1.

CRYPTOGRAPHY Cryptography is art or science of transforming intelligible message to unintelligible and again transforming that message back to the original.

Digital Signatures.

Vocabulary Big Data - “Big data is a broad term for datasets so large or complex that traditional data processing applications are inadequate.” Moore’s.

Taehyung Kim HPC Lab. POSTECH

PART VII Security.

Rivest, Shamir and Adleman

Security in Distributed Systems

Chapter Goals Define cryptography

Encryption & Steganography: Amazing Things To Do with Bits

10/7/2019 Created by Omeed Mustafa 1 st Semester M.Sc (Computer Science department) Cyber-Security.

Presentation transcript:

Encryption Encryption encodes information to hide it from everyone else … maintaining your privacy

Maintaining Privacy To keep information private it must be hidden from “prying” computers As children, most of us used “secret” codes Most often the code was a Caesar Cipher -- an alphabetic shift by a constant amount Coded Text: IJKLMNOPQRSTUVWXYZABCDEFGH Clear Text: ABCDEFGHIJKLMNOPQRSTUVWXYZ VW EIZ QV QZIY EncodeDecode

Breaking Caesar Cipher Fixed substitutions don’t work, ‘cause letters have a known distribution In a large text, count the frequency of each letter, match the results to distribution The twelve most frequent letters account for 80% of English text ETAOINSHRDLU A*ERI*A THE *EAUTI*UL

Encryption Issue Traditionally, encryption technology has been “breakable” with effort Breakable codes let law enforcement and governments watch criminals and spies Codes are good enough for the honest

Encryption Issue Traditionally, encryption technology has been “breakable” with effort Breakable codes let law enforcement and governments watch criminals and spies Codes are good enough for the honest  New computer encryption is unbreakable  It’s called “strong encryption” … should it be legal to be able to keep secrets absolutely? Strong encryption: serious issue of public interest

General Encryption Setup Encryption is most important for when sending information Clear Text T Sender Encrypt w/K sr Cipher Text E sr (T) Receiver Decrypt w/K sr Clear Text D sr (E sr (T)) = T K sr

Problem: Key Exchange To communicate securely, users must meet before sending/receiving Clear Text T Sender Encrypt w/K sr Cipher Text E sr (T) Receiver Decrypt w/K sr Clear Text D sr (E sr (T)) = T K sr This doesn’t work for eCommerce

Revise Encryption Setup Public Key Encryption is based on publishing the key Sender uses public key to encrypt Clear Text T Sender Encrypt w/K r Cipher Text E r (T) Receiver Decrypt w/K r Clear Text T = D r (E r (T)) K sr

Public Key Encryption Using the public key, encrypt message Divide T, the clear text bytes, into blocks Treat each block as a number Cube number (raise to 3 pwr), divide by key Send the remainder for each block T: / K r /K r / K r / K r 19

Public Key Cryptography Does PKC work? Can’t it be cracked? Recall definition of divide: a=b  c + d For example, 50/6 implies 50=6  The encryption process is a division: T 3 =K r  c + d so sending c&d determines clear text T QuotientRemainder But we only send d!

RSA Encryption Rivest, Adelman and Shamir invented a PKC scheme called RSA The secret is to pick the key, K r, right Pick two prime numbers -- numbers divisible only by themselves and 1 -- that are 2 greater than a multiple of 3 … weird! Examples are 5, 11, 17, 23, 29,... K r = p  q so that it is 129 digits Follow procedure given, send remainders

How To Recover Message Compute s=1/3(2(p-1)(q-1)+1) then compute C s = K r  c + T  That is … The remainders (C) raised to s power equal K r times some (quotient) c no one cares about plus the original clear text number! So, raise the remainders to s, divide by K r and PRESTO! the new remainder is the answer For p=17 and q=23, pq= 391 and s=235

What Makes RSA Work? Though the numbers get huge, computer can handle them quickly These codes are strong because breaking them needs s, which needs p, q, which means factoring K r Factoring is computationally tough -- best methods are only somewhat better than grammar school, “try all small primes” Picking 129 digit key, means no computer can factor it … so the code is unbreakable

RSA Challenge After inventing their scheme (1977), RSA challenged people to break it Their first key was broken in 1994 using 1000 computers over 8 months Their secret message: THE MAGIC WORDS ARE SQUEAMISH OSSIFRAGE Doomed? No. There are many other 129 digit keys, or if people get nervous make 200 digit keys or more … breaking gets harder very fast; encrypt/decrypt doesn’t

Is Strong Encryption Smart Should we allow people to use strong encryption? Or should only breakable codes be legal? It hampers law enforcement and security Most criminals reveal plans in other ways PKC exists and is known, so build in escape -- Trap door -- Key Escrow But are these schemes really secure?