Week 9 - Cryptography Flashcards

1
Q

What is the fundamental idea behind cryptography?

A
  1. Confidentiality (encryption and decryption)
  2. Data integrity (data has a has, to ensure data has not been tampered with)
  3. Authentication and non-repudiation (digital signature)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is an example of a simple algorithm for encryption? What are the ways to decrypt it?

A

The Caesar cipher.
1. Find a pattern
2. Brute force guess and check

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

What is the limitation behind this ceasar cipher?

A

Relies on security by obscurity. The algorithm is obscuring it.

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

What is the kerchoff’s principle

A

A crypto system should be secure even if the attacker knows all the details about the system with the exception of the secret key. In particular, the system should be secure even when the attacker knows the encryption and decryption algorithm

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

What is a cryptographic key?

A

A key is a strong of characters used within an encryption algorithm for altering data so it appears random

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

Symmetric encryption, what are the two core components?

A
  1. A secure secret key
  2. Strong encryption algorithm
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is a secure secret key?

A

Both the sender and receiver must have obtained copies of the secret key in a secure fashion and they must keep the key secure.

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

What defines a strong encryption algorithm?

A

The opponent should be unable to decrypt ciphertext or discover the key even if he/she is in possession of a number of cipher texts together with the plaintext that produced each ciphertext.

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

What is the limitation behind a symmetric encryption?

A

How are you going to share the key?

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

Number theory

A

It is computationally hard to find the prime number of a large number.

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

How is this useful for cryptography?

A

It forms the one way relationship: easy to form the prime number but difficult to reverse engineer it. The adversary wont be able to brute force it.

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

Public key encryption: key generation

A

Since its hard to derive the prime numbers forming the public key (p and q)
We can add an additional level of security by using some mathematical formula to form a private key out of the prime numbers.

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

How to decode the message. If lets say the message is represented by the number 200.

A

We use the public key to encrypt the secret message (200 —> 61)
The person with the private key can successfully convert 61 —> 200

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

Why should we use asymmetric encryption?

A

Public keys are always available on the public domain (to share). You are relying on the unique mathematical relationship to decode it. This is very hard to guess.

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

How does asymmetric key encryption work?

A
  1. Alice generates a pair of keys using an asymmetric key algorithm - private key is always kept secret by the user and the public key is broadcasted out to the network
  2. Bob has access to Alice’s public key
  3. He uses Alice’s public key to encrypt his message to her [hexadecimal]
  4. Alice is able to decrypt using her private key
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

How does cryptography assist with digital signatures?

A

You can prove that the person with the private key signed and sent the message. You are using someone’s private key to append the information

17
Q

How do digital signatures work?

A
  1. Alice writes a message
  2. Message is hashed
  3. Hash is encrypted with Alice’s private key
  4. Message and encrypted hash are sent
  5. Hash is decrypted by Bob using Alice’s public key

Note: message is not encrypted

18
Q

What is a cryptographic hash?

A

String of text - put through a function - fixed length number

19
Q

What are the features of a cryptographic hash?

A

Deterministic, one way, diffusion, non-predictable, collision resistant (DODNC)

20
Q

What’s the difference between hash and key encryption?

A

Hash is irreversible. It’s to check to see if the file has been tampered with.
Key encryption is reversible. It’s for security reasons.