LIGN 17 Midterm 1

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/35

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

36 Terms

1
New cards

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

2
New cards

Substitution cipher

Characters staying in their places but changing identities

3
New cards

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>
4
New cards

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>
5
New cards

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.

6
New cards

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

7
New cards

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

8
New cards

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

9
New cards

Monoalphabetic Substitution Cipher

Each letter in plaintext maps to one symbol in ciphertext.

Ex: Caesar Shift Cipher, Monoalphabetic with key phrase

10
New cards

Monoalphabetic Substitution Cipher w/ Homophones

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

11
New cards

Polyalphabetic Substitution Cipher

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

Ex: Vigenere Cipher

12
New cards

One-time Pad Cipher

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

13
New cards

Book Cipher

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

14
New cards

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

15
New cards

Binary Transposition Cipher

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

16
New cards

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

17
New cards

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

18
New cards

First In First Out (Caesar Cipher)

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

19
New cards

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

20
New cards

Diffie-Helman protocol

Z = Y^X (mod P)

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

21
New cards

Book cipher is most similar to

Monoalphabetic substitution cipher with homophones

22
New cards

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>
23
New cards

Define cryptography

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

24
New cards

Null

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

25
New cards

What ____% of letters in English are E?

12.7

26
New cards

What ____% of letters in English are T?

9.1

27
New cards

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.

28
New cards

Cryptographic crib

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

29
New cards

Decimal

Base 10. What humans use

30
New cards

XOR Cipher

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

31
New cards

bit

short for binary digit

32
New cards

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.

33
New cards

key distribution problem

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

34
New cards

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

XOR and Caesar shift

35
New cards

Binary addition

36
New cards

Modular Arithmetic

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