Presentation is loading. Please wait.

Presentation is loading. Please wait.

 8 groups of 2  5 rounds  Basic Definitions  Substitution Cryptosystems  Math  Tricky Questions  Comparing Cryptosystems  10 questions per round.

Similar presentations


Presentation on theme: " 8 groups of 2  5 rounds  Basic Definitions  Substitution Cryptosystems  Math  Tricky Questions  Comparing Cryptosystems  10 questions per round."— Presentation transcript:

1

2  8 groups of 2  5 rounds  Basic Definitions  Substitution Cryptosystems  Math  Tricky Questions  Comparing Cryptosystems  10 questions per round  Each question is worth 1 point

3 1. Alice and Bob should at some point have access to a ________ mode of communication. 2. Cryptography is only needed when a message is both _______ and ________. 4. To determine how difficult a cryptosystem is to break, we measure its ________. 5. To determine how quickly a cryptosystem operates, we measure its ________.

4 6. _______ is the science of keeping information secure even though it is transmitted through an insecure medium. 7. _______ is the science of breaking ciphers. 8. A _______ is a matching between two different alphabets. 9. To break a cipher means to determine the ______. 10. A cryptosystem is made up of five parts: plaintext space, ciphertext space, encryption function, decryption function, and __________.

5

6

7

8

9

10

11

12 The End

13  Created in the summer of 2013 by Dr. Jeffrey Beyerl for use in a cryptography class.  This is just a vanilla PowerPoint, but of course like anything you download from the internet: use at your own risk.


Download ppt " 8 groups of 2  5 rounds  Basic Definitions  Substitution Cryptosystems  Math  Tricky Questions  Comparing Cryptosystems  10 questions per round."

Similar presentations


Ads by Google