RSA Flashcards

1
Q

What is the key generation for RSA?

A
  1. Pick two large prime numbers p and q
  2. Let n = pq (the modulus)
  3. Compute (p-1)(q-1)
  4. Find a number e which is coprime/relatively prime with (p-1)(q-1). e is also called the public exponent.
  5. Compute the multiplicative inverse d of e modulo (p-1)(q-1). d is also called the private exponent.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How do you encrypt a message (m) using RSA?

A

m^e mod n
Where:
m = message
e = public exponent
n = the modulus

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

How do you decrypt a ciphertext (c) using RSA?

A

c^d mod n
Where:
d = private exponent
n = the modulus

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

If x is the multiplicative inverse of y then:

A

x * y = 1

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

If x is y’s multiplicative inverse modulo n if:

A

(x * y) mod n = 1

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

Is RSA secure?

A

Brute force attacks are infeasible for large numbers.
The most efficient way to attack RSA is by factoring n the modulus as this would get you p and q and allow you to calculate everything else. However factoring integers is intracteable

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

Define relatively prime for x and y:

A

Two integers x and y are relatively prime if their greatest common divisor is 1

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

What are the two types of MACs for hashing?

A
  1. Combine hashing with a secret key. Constructed with help from a hashing function
  2. Build the MAC from a block cipher
How well did you know this?
1
Not at all
2
3
4
5
Perfectly