Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

C839 > 01 Ciphers > Flashcards

01 Ciphers Flashcards

1
Q

What are 3 uses for encryption?

A

preserve privacy
check integrity
prove identity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Consider the use of a symmetric encryption algorithm and an asymmetric encryption algorithm. Which is used to authenticate identities? Which is used for the actual core encryption of data? Which is used to pass encryption keys?

A
  1. Asymmetric
  2. Symmetric
  3. Asymmetric
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the main use of secret-key encryption?

A

Protecting the contents of a message

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the main use of public-key encryption?

A

Proving the identity of a message’s sender or recipient

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the main use of hashing methods?

A

Proving the validity of a message

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the main use of message signatures?

A

Providing the identity of a message sender and the contents of the message

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

A code mapping in which pulses are sent along a medium, with silence in between groups of dots and dashes comprising individual charachters

A

morse code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What type of cipher is the Pigpen Cipher?

A

mono-alphabetic substitution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Describe the BIFID cipher

A
  • grid-based, 5x5
  • maps letters into numeric values
  • 1901, Delastelle
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Describe the Playfair cipher

A
  • grid-based, 5x5
  • encrypts pairs of digraphs
  • frequency analysis does NOT work with it
  • 1854, Charles Wheatstone / Lord Playfair
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Describe the Homophonic Substitution Cipher

A
  • aims to overcome frequency analysis
  • varies the number of codes mapped to each letter
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Describe the Caesar Cipher

A
  • transposition cipher
  • Julius Caesar
  • originally, shifted the plaintext alphabet 3 chars
  • modern implementations, both parties agree on the direction and degree of the shift
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Describe the Scrambled Alphabet Cipher

A
  • improved on Caesar cipher
  • randomly maps plaintext to ciphertext
  • 26! possible mappings (4.03x10^26)
  • still susceptible to brute-force attacks (Eve needs to search through 50% of the possible solutions)
  • can be cracked quickly by using frequency analysis
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Describe the Vigenere Cipher

A
  • an improvement on the scrambled alphabet cipher
  • based on selected keyword & polyalphabetic mapping
  • invented 1553, Giovan Battista Bellaso
  • cracked by Kasiski, 1863
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Describe One-time Pad

A
  • used only once, then discarded
  • generally considered unbreakable
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Describe ASCII encoding

A

7-bit
8-bit
printable characters mapped to decimal, binary, & hex values

17
Q

Describe Base-64 encoding

A

hexadecimal encoding
take values 6 bits at a time

18
Q

Describe the Enigma machime

A
  • multi-alphabet substitution cipher
  • used machinery to accomplish encryption
  • specifically, electromechanical rotors
19
Q

Describe the Affine cipher

A
  • mono-alphabetic substitution cipher
  • each letter is mapped to a numeric equivalent, encrypted using a mathematical function, and converted back to a letter
20
Q

What formula describes combinations?

A

nCk = n!/k!(n-k)!

21
Q

What formula describes permutations?

A

nPk = n!/(n-k)!

22
Q

Suppose you are considering the probability of two independent events A & B. What is the probability of both events occurring?

A

P(A and B) = P(A) * P(B)

23
Q

Suppose you are considering the probability of two mutually exclusive events. How would you express this probability mathematically?

A

P(A and B) = 0

24
Q

Suppose that you roll a dice. What is the probability of throwing a two or a three?

A

P = 1/6 (one in six chances of rolling a given number)
P(2) + P(3) = P(A and B)
1/6 + 1/6 = 1/3

25
Q

Suppose that you throw two dice. What is the chance of two ones being thrown?

A

Each dice is independent (multiplication)
P(1) * P(1)
1/6 * 1/6 = 1/36

26
Q

When performing a modulus operation, what value is returned?

A

The remainder of an integer division

27
Q

Modulo-2 addition (or subtraction) is equivalent to this function.

A

X-OR

28
Q

Modulo-2 multiplication is equivalent to this function

A

Logical AND

29
Q

What is the GCD?

A

The largest possible integer that divides into two numbers without a remainder. Also called the greatest common factor.

30
Q

What are characteristics of PRNGs?

A
  • repeats the random numbers after some period of time
  • fast
  • deterministic
  • return a repeatable set of random numbers (testing)
31
Q

What are characteristics of TRNGs?

A
  • generates a true random number
  • takes entropic input
  • slow (requires human interaction)
  • non-deterministic
  • aperiodic

C839 (5 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions