Week 2 - Randomness + One-Time Pads Flashcards

1
Q

what is true Randomness?

A

numbers have no discernible patterns and each event is equally probable

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

Examples of True Randomness?

A
  • coin flip
  • national lottery
  • lava lamp movements
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

: What is a pseudo-random number generator?

A

an algorithm that produces a series of random numbers based on an initial seed

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

what is a seed in PRNG?

A

an initial value that is kept secret + used to reproduce the sequence

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

What is a Cryptographically Secure Pseudo-Random Number Generator (CSPRNG)?

A

a type of PRNG that is indistinguishable from true randomness + secure against attacks

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

Why are CSPRNGs used in cryptography?

A

they are efficient and useful when sequences need to be replicated securely

or

produce random numbers that are unpredictable and resistant to cryptanalysis

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

what is a one time pad (OTP)?

A

an encryption method where a truly random key is used to encrypt a message

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

what are the four requirements for an OTP?

A
  1. key is truly random
  2. only two copies exist, (encryption and decryption).
  3. key is used once and destroyed after use
  4. key must be as long as message
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is “perfect secrecy”?

A

when OTP is correctly implemented and is unbreakable regardless of computational power

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

What are the practical challenges of OTP?

A

generating long random keys + securely sharing them is difficult

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

What is the middle square method?

A

an early version of PRNG where the seed is squared, middle digits are extracted and the process is repeated

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

How does a one-time pad encrypt and decrypt messages?

A

each character in the message is combined with a corresponding character from the random key

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