4.5.6.8 Encryption Flashcards Preview

Computing Theory > 4.5.6.8 Encryption > Flashcards

Flashcards in 4.5.6.8 Encryption Deck (6)
Loading flashcards...
1
Q

What is encryption?

A

Using an algorithm to convert a message into an unreadable form or ciphertext so only the intended receiver can use their key to decrypt the message.

2
Q

How is the two-key system used to encrypt and decrypt?

A

The data is encrypted with the receiver’s public key, and the receiver uses their private key to decrypt the data

3
Q

Why is caesar cipher easy to crack?

A

Because it uses symmetric encryption, the same key is used to encrypt and decrypt

4
Q

How does a caesar cipher work?

A

Replace each plaintext letter with a different one a fixed number of places down the alphabet, using a key.

5
Q

How does the vernam cipher / one time pad work?

A

The key is a set of letters at least as long as the plaintext (so it may be repeated).
In order to cipher a text, take the first letter of the message and the first letter of the key, add their value and find the corresponding letter.
The key must be used once only. The key is known as a one-time pad

6
Q

Explain why Vernam cipher is considered as a

cypher with perfect security

A

Vernam cipher is the only one to have been
mathematically proved to be completely secure. In theory, every cryptographic algorithm except for Vernam cipher can be broken, given enough ciphertext and time.

Decks in Computing Theory Class (102):