Presentation is loading. Please wait.

Presentation is loading. Please wait.

Encryption & Steganography: Amazing Things To Do with Bits

Published byNiilo Niemi Modified over 5 years ago

Similar presentations

Presentation on theme: "Encryption & Steganography: Amazing Things To Do with Bits"— Presentation transcript:

1 Encryption & Steganography: Amazing Things To Do with Bits
Computing Is Pretty Strange Encryption & Steganography: Amazing Things To Do with Bits Lawrence Snyder University of Washington, Seattle © Lawrence Snyder 2004

2 Encryption Encryption is the process of “scrambling” data so it is difficult (impossible?) to understand it We encrypt data to keep it private Every site that you use as is encrypted Familiar example: Caesar cipher: C: 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 E: D E F G H I J K L M N O P Q R S T U V W X Y Z A B C What would Julius be encrypted to? 8/18/2019 © 2011 Larry Snyder, CSE

3 Encryption Encryption is the process of “scrambling” data so it is difficult (impossible?) to understand it We encrypt data to keep it private Every site that you use as is encrypted Familiar example: Caesar cipher: C: 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 E: D E F G H I J K L M N O P Q R S T U V W X Y Z A B C What would Julius be encrypted to? Mxolxv 8/18/2019 © 2011 Larry Snyder, CSE

4 More Typically … The fixed shift of an alphabet is easy to break
Alternate: Sender uses a key, k, to multiply clear byte sequences (recall they’re numbers) by k -- Send encrypted result – looks like gibberish -- Receiver divides by k to decrypt getting clear 8/18/2019 © 2011 Larry Snyder, CSE

5 Example Let the clear be: “MEET @ 9” and k=13
Break clear text into 2-letter sequences: ME ET b9 Interpret text as numbers Multiply by key: Send encrypted (6-digit) number Receiver does the reverse process … 776913=100997 698413=090792 326413=042432 325713=042341 8/18/2019 © 2011 Larry Snyder, CSE

6 An Alternate: Public Key Encrypt
The problem with “private key” encryption: the two sides have to meet to agree on key Public Key fixes this: The receiver publishes (on Web site, say) a (very very special) key, K More importantly, the theory it uses means that NO practical amount of computing can break the code Here’s what you do … 8/18/2019 © 2011 Larry Snyder, CSE

7 Public Key Process Sender breaks up the message into blocks as before
Sender cubes each block – yup, raises to the 3rd power – and mods it by K, i.e. (<text>3)%K Transmit results Receiver raises each remainder to a high power determined by prime numbers & known only to him Receiver mods by K, too, which are – surprisingly – the original blocks! The receiver assembles the message Thanks to Euler and Diffie & Hellman This Is Amazing!!! 8/18/2019 © 2011 Larry Snyder, CSE

8 Steganography The process of hiding information
Two Greek roots meaning: “stego” == “roof” “stega” == “cover” 8/18/2019 © 2011 Larry Snyder, CSE

9 Why Hide Information? Most common reason to hide information is to avoid being caught with it Military and spy documents Repressive governments restricting news/info Avoid others “snooping” – privacy Hiding is different than encryption … uses the fact that the searcher doesn’t know it’s there 8/18/2019 © 2011 Larry Snyder, CSE

10 Illustrate A Way To Do It
The Plan … hide “subversive” protest picture in “calendar art” Host Image Guest Image 8/18/2019 © 2011 Larry Snyder, CSE

11 Step 1: Reduce Bits of Guest
We don’t need all of the bits in RGB to get a decent picture All bits Left 2 bits of each color 8/18/2019 © 2011 Larry Snyder, CSE

12 Step 2: Replace Bits In Host
Put guest bits into right 2 bits of host 8/18/2019 © 2011 Larry Snyder, CSE

13 Compare fog.jpg with stegFog.png
Really? Just Do It! fog.jpg 8/18/2019 © 2011 Larry Snyder, CSE

14 Let’s Look At Them … and then we’ll see the details 8/18/2019
© 2011 Larry Snyder, CSE

15 Processing Code For GuestHost
Code To Save Result on Click Encoding Code 8/18/2019 © 2011 Larry Snyder, CSE

16 How Does It Work After the pictures are loaded
Clear right 2 bits of host Extract left 2 bits of guest New combined color 8/18/2019 © 2011 Larry Snyder, CSE

17 Code To Extract Image 8/18/2019 © 2011 Larry Snyder, CSE

18 How Does It Work Read in the file, and then on mouse click, pull out the bits and make a picture Remove right 2 bits Make them left 2 bits for each color New color 8/18/2019 © 2011 Larry Snyder, CSE

19 How Much Is Coded Like Original?
Run A Test … The Original 8/18/2019 © 2011 Larry Snyder, CSE

20 Check The “Steganized” File
8/18/2019 © 2011 Larry Snyder, CSE

Download ppt "Encryption & Steganography: Amazing Things To Do with Bits"

Similar presentations

Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesThe Mighty Mod.

Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesThe Mighty Mod.
Cryptography Ch-1 prepared by: Diwan.

Cryptography Ch-1 prepared by: Diwan.
Computer Science 101 Data Encryption And Computer Networks.

Computer Science 101 Data Encryption And Computer Networks.
Section 3.8: More Modular Arithmetic and Public-Key Cryptography

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.

 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.
Shared Secrets Keeping secrets on the web. Encryption Goal : hidden in plain sight.

Shared Secrets Keeping secrets on the web. Encryption Goal : hidden in plain sight.
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.

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.

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.

Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.
CC3.12 Erdal KOSE Privacy & Digital Security Encryption.

CC3.12 Erdal KOSE Privacy & Digital Security Encryption.
20-751 ECOMMERCE TECHNOLOGY SUMMER 2002 COPYRIGHT © 2002 MICHAEL I. SHAMOS Cryptographic Security.

ECOMMERCE TECHNOLOGY SUMMER 2002 COPYRIGHT © 2002 MICHAEL I. SHAMOS Cryptographic Security.
20-751 ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.

ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.
Cryptography (continued). Enabling Alice and Bob to Communicate Securely m m m Alice Eve Bob m.

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

Public Key Cryptography
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 1 Security PART VII.

McGraw-Hill©The McGraw-Hill Companies, Inc., Security PART VII.
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.

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.
Chapter 13: Electronic Commerce and Information Security Invitation to Computer Science, C++ Version, Fourth Edition SP09: Contains security section (13.4)

Chapter 13: Electronic Commerce and Information Security Invitation to Computer Science, C++ Version, Fourth Edition SP09: Contains security section (13.4)
1 Introduction to Codes, Ciphers, and Cryptography Michael A. Karls Ball State University.

1 Introduction to Codes, Ciphers, and Cryptography Michael A. Karls Ball State University.
Chapter 12 Cryptography (slides edited by Erin Chambers)

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.

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.

Similar presentations

Ads by Google