Public key encryption

studied byStudied by 0 people
0.0(0)
learn
LearnA personalized and smart learning plan
exam
Practice TestTake a test on your terms and definitions
spaced repetition
Spaced RepetitionScientifically backed study method
heart puzzle
Matching GameHow quick can you match all your cards?
flashcards
FlashcardsStudy terms and definitions

1 / 8

encourage image

There's no tags or description

Looks like no one added any tags here yet for you.

9 Terms

1

Broadly how does public key encryption work?

The public key is used by the sender to encrypt a message
The private key is used by the recipient to decrypt the message.

(Also called asymmetric key encryption)

New cards
2

What does public key encryption guarantee?

Confidentiality
Integrity

(both because only the recipient can decrypt)

New cards
3

What is a one-way function?

A function whose outputs can be quickly calculated and verified given the inputs
But whose inputs cannot be quickly verified given the outputs.

New cards
4

Under what conditions is f(x) = y^x \text{ mod } p a one-way function?

y is the primitive root mod p
p is a very large number (e.g. 512-bit)

New cards
5

Why is f(x) = y^x \text{ mod } p a one-way function?

  • Each successive power of y is a value in the range [1, p - 1]

  • The values of y are uniformly distributed across the range [1, p - 1]

  • So if one were to guess the value of x, the probability of correctly guessing would be \frac{1}{p - 1}

  • When p is large the probability of a correct guess would be very small, making it computationally infeasible to guess using brute force

New cards
6

What values are publicly known in an RSA encryption scheme?

n = p * q

e = A prime number in the range [1, (p - 1) * (q - 1)] that is coprime to (p - 1) * (q - 1)

New cards
7

What are the hidden values in an RSA encryption scheme?

p, q = Two very large, prime numbers
d = The private key, the modular inverse of e under mod (p - 1)*(q - 1)

e*d \equiv 1 \quad(\text{mod } (p - 1) * (q - 1))

New cards
8

Give a public key encryption scheme

RSA

New cards
9

What are the formulae for encryption and decryption in the RSA encryption scheme?

C = M^e\quad (\text{mod } n)

M = C^d\quad (\text{mod } n)

New cards

Explore top notes

note Note
studied byStudied by 14 people
1005 days ago
4.0(1)
note Note
studied byStudied by 162 people
624 days ago
5.0(1)
note Note
studied byStudied by 16 people
122 days ago
5.0(1)
note Note
studied byStudied by 22 people
743 days ago
5.0(1)
note Note
studied byStudied by 61 people
882 days ago
4.0(1)
note Note
studied byStudied by 8 people
176 days ago
5.0(1)
note Note
studied byStudied by 10 people
898 days ago
5.0(1)
note Note
studied byStudied by 255 people
686 days ago
4.8(9)

Explore top flashcards

flashcards Flashcard (127)
studied byStudied by 31 people
911 days ago
5.0(1)
flashcards Flashcard (20)
studied byStudied by 19 people
266 days ago
5.0(1)
flashcards Flashcard (20)
studied byStudied by 8 people
784 days ago
5.0(1)
flashcards Flashcard (28)
studied byStudied by 29 people
737 days ago
5.0(2)
flashcards Flashcard (67)
studied byStudied by 9 people
837 days ago
5.0(1)
flashcards Flashcard (315)
studied byStudied by 51 people
763 days ago
5.0(4)
flashcards Flashcard (29)
studied byStudied by 15 people
379 days ago
5.0(1)
flashcards Flashcard (26)
studied byStudied by 84 people
17 days ago
5.0(1)
robot