Lecture 4 - Public Key Encryption Flashcards

1
Q

Describe the steps involved in ensuring confidentiality of a message.

A
  1. Bob encrypts the plaintext message using Alices public key
  2. The produced ciphertext message is transmitted by Bob to Alice.
  3. Alice decrypts the ciphertext message using her private key

Secure message format uses the recipient’s private key to protect message confidentiality.

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

Describe the steps involved in ensuring authenticity of a message.

A
  1. Bob encrypts the plaintext message using his private key
  2. The produced ciphertext message is transmitted by Bob to Alice.
  3. Alice decrypts the ciphertext message using Bobs public key

Open message format uses the sender’s private key to ensure authenticity.

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

Describe the steps involved in ensuring both confidentiality and authenticity of a message.

A
  1. Bob encrypts the plaintext message using Alice’s public key and then his own private key.
  2. The produced ciphertext message is transmitted by Bob to Alice.
  3. Alice uses Bobs public key to verify the authenticity of the message and then decrypts the ciphertext message using her private key.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

True / False

Public key encryption is too slow for real-time communication

A

True

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

List three aspects that describe public key encryption

A
  1. Is an asymmetric key method
  2. Uses a Public key and a Private Key
  3. Is excellent for keeping data secure
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

List the three maths methods that Public Key encryption use

A
  1. Integer Factorisation (RSA)
  2. Discrete Logarithms (ElGamal)
  3. Elliptic Curve Relationships (Elliptic Curve)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Provide a definition for RSA

A

RSA is an asymmetric key algorithm based on factoring prime numbers

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

What is the greatest common divisor (gcd)

A

The greatest common divisor (gcd) between two numbers is the largest integer that will divide both numbers.

Example gcd(4,10) = 2

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

Provide a definition for a prime number

A

Defined as a number that can only be divided without a remainder by itself and 1

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

List two advantages to public key encryption

A
  1. The main advantage of this type of cryptography is its increased data security. Because users never need to transmit or reveal their private keys to anyone.
  2. Digital signatures that cannot be repudiated
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

List two disadvantages to public key encryption

A
  1. computational overhead means it is slow
  2. As computers get faster, brute force attacks will become more practical
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

RECAP LECTURE

MD5 hashing is vulnerable to what type of attacks?

A

Collision attacks

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

RECAP LECTURE

Diffie-Helman key exchange is vulnerable to what type of attacks?

A

MITM Attacks

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

RECAP LECTURE

The RSA algorithm involves three steps. List them

A
  1. Key generation
  2. Encryption
  3. Decryption
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

RECAP LECTURE

Fill in the blanks

RSA creates a ___ ___ (public and private) for a single user

A

RSA creates a key pair (public and private) for a single user

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