LIGN 17 Midterm 1

studied byStudied by 0 people
0.0(0)
learn
LearnA personalized and smart learning plan
exam
Practice TestTake a test on your terms and definitions
spaced repetition
Spaced RepetitionScientifically backed study method
heart puzzle
Matching GameHow quick can you match all your cards?
flashcards
FlashcardsStudy terms and definitions

1 / 35

encourage image

There's no tags or description

Looks like no one added any tags here yet for you.

36 Terms

1

Transposition Cipher

symbols maintain their identities but change their positions

Ex: Binary Transposition, just switching 0 and 1. So you should have the same number of characters as the original plaintext for each symbol

or ADTC

New cards
2

Substitution cipher

Characters staying in their places but changing identities

New cards
3

One-to-one Mapping

• Each symbol in the plain alphabet maps to a single
symbol in the cipher alphabet.
• Each symbol in the cipher alphabet maps to a single
symbol in the plain alphabet.

Ex: MSC

<p>• Each symbol in the plain alphabet maps to a single<br>symbol in the cipher alphabet.<br>• Each symbol in the cipher alphabet maps to a single<br>symbol in the plain alphabet.<br><br>Ex: MSC</p>
New cards
4

Define nomenclators

a combination of codes and ciphers when a single symbol can map to a single letter AND a symbol can map to a phrase

e.g. 12=t and 34=the

<p>a combination of codes and ciphers when a single symbol can map to a single letter AND a symbol can map to a phrase</p><p>e.g. 12=t and 34=the</p>
New cards
5

Let’s suppose that instead of using a simple monoalphabetic substitution cipher (MSC),  Alice decides to do something different and use three such ciphers, applying them in succession in the following way. First, she encrypts the plaintext using an MSC with her first key, to create the first ciphertext.  Then, she encrypts that ciphertext using an MSC with a second, different key, yielding a second ciphertext. Finally, she encrypts that ciphertext with a third key, yielding a third ciphertext that she sends to Bob.  

Which of the following statements is most true?

The resulting cipher is generally going to be equally secure as if Alice had used just one, since for any three monoalphabetic substitution cipher keys applied one after the other, there exists another, single monoalphabetic substitution cipher key that achieves the same result.

New cards
6

Kerckhoff’s Principle

The security of a cryptogr-system must not depend on keeping secret the crypto-algorithm. The security depends only on keeping secret the key.

I.e. assume that Eve knows everything about the system except for the key

New cards
7

One-to-many Mapping

• Symbols in the plain alphabet can map to more than
one symbol in the cipher alphabet.
• Each symbol in the cipher alphabet maps to a single
symbol in the plain alphabet.

Ex: MSC w/ Homophones

New cards
8

Many-to-many Mapping

• Symbols in the plain alphabet can map to more than
one symbol in the cipher alphabet.
• Symbols in the cipher alphabet can map to more than
one symbol in the plain alphabet.

Ex: Vigenere

New cards
9

Monoalphabetic Substitution Cipher

Each letter in plaintext maps to one symbol in ciphertext.

Ex: Caesar Shift Cipher, Monoalphabetic with key phrase

New cards
10

Monoalphabetic Substitution Cipher w/ Homophones

Based on frequency, letter in plaintext maps to many symbols in ciphertext

New cards
11

Polyalphabetic Substitution Cipher

The letters in the plaintext map to multiple symbols in the cipher text

Ex: Vigenere Cipher

New cards
12

One-time Pad Cipher

• Key has to be as long as plaintext
• Key is generated randomly
• Key is never repeated
• Unbreakable

New cards
13

Book Cipher

• A book or text is the key
• Number each word (or letter) in key

New cards
14

Kasiski-Babbage Method

•A method for breaking Vigenere Cipher

Analyze the text for repetitions, deduce the length of the keyword or phrase (call this N)
• Do frequency analysis on N different (Caesar Shift) ciphers

New cards
15

Binary Transposition Cipher

Reverse pairs of digits i.e. switch 1st and 2nd digits, 3rd and 4th digits

New cards
16

Binary Substitution Cipher

Plaintext and codeword, if digits are the same, put 0 in ciphertext, if different, put 1 in chiphertext
• DECRYPTION ALGORITHM IS SAME AS ENCRYPTION ALGORITHM!
• Reciprocal algorithm

New cards
17

First In First Out (Monoalphabetic Cipher)

• Alice's key to encrypt, Bob's key to encrypt again
• Alice's key to decrypt first, Bob's key to decrypt second

New cards
18

First In First Out (Caesar Cipher)

• First shift 4, then shift 2
• Shift 2 in opposite direction, shift another 4

New cards
19

One-Way Functions

• Easy to compute in a forward direction but difficult to reverse
• Metaphor: mixing paint. We don’t have a way of separating colors once mixed

New cards
20

Diffie-Helman protocol

Z = Y^X (mod P)

a solution to the Key Distribution problem. ALSO, not a form of cryptography!!!

New cards
21

Book cipher is most similar to

Monoalphabetic substitution cipher with homophones

New cards
22

Define Steganography

Secret communication is achieved by masking the existence of a message (hidden message)

<p>Secret communication is achieved by masking the existence of a message (hidden message)</p>
New cards
23

Define cryptography

Secret communication is achieved by masking the content (scrambled message)

New cards
24

Null

a symbol in the ciphertext that corresponds to nothing in the plaintext

New cards
25

What ____% of letters in English are E?

12.7

New cards
26

What ____% of letters in English are T?

9.1

New cards
27

What is a Dowbleth?

A symbol in the ciphertext that means "repeat the letter beside me" on the left or right to eliminate double letter giveaways.

New cards
28

Cryptographic crib

When Eve hypothesizes possible pieces of the plaintext to deduce the key

New cards
29

Decimal

Base 10. What humans use

New cards
30

XOR Cipher

A type of Binary substitution cipher. Switching the zeros and ones that are next to each other.

New cards
31

bit

short for binary digit

New cards
32

DES (Data Encryption Standard)

In the 70s, computers used this combination of transposition and substitution. 56-bit keys. By 1999, it took less than a day for a computer to break this.

New cards
33

key distribution problem

How can Alice and Bob agree on a key when Eve is intercepting all communication?

New cards
34

Which are the two ciphers in which the padlock metaphor actually would work?

XOR and Caesar shift

New cards
35

Binary addition

New cards
36

Modular Arithmetic

You divide by the mod. Your answer is the remainder (if there is a remainder)

New cards
robot