Module 4 Flashcards

Cryptography

1
Q

Cryptography

A

The process of converting data into unintelligible form to ensure confidentiality, integrity, and authentication.

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

Plaintext

A

The original message that needs to be protected.

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

Ciphertext

A

The scrambled message produced after encryption.

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

Encryption Function

A

A function that transforms plaintext into ciphertext using a key.

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

Decryption Function

A

A function that transforms ciphertext back into plaintext.

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

Symmetric Encryption

A

An encryption method where the same key is used for both encryption and decryption.

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

Asymmetric Encryption

A

An encryption method where two different keys (public and private) are used for encryption and decryption.

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

Brute-Force Attack

A

An attack where all possible keys are tried on a ciphertext until the correct one is found.

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

Caesar Cipher

A

A classical cipher where each letter in the plaintext is shifted by a fixed number of positions in the alphabet.

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

Vigenère Cipher

A

A polyalphabetic substitution cipher where the letters are shifted by different amounts based on a repeating key.

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

Block Cipher

A

A cipher that encrypts blocks of plaintext at a time rather than one bit or byte at a time.

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

Stream Cipher

A

A cipher where encryption is done one bit or byte at a time, often using XOR operations.

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

Diffie-Hellman Key Exchange

A

A key exchange algorithm that allows two users to agree on a shared secret key without using a secure channel.

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

RSA

A

An asymmetric cryptosystem used for encrypting messages and digital signatures, based on the difficulty of factoring large integers.

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

Digital Signature

A

A cryptographic mechanism used to ensure the authenticity of a message by allowing the sender to sign the message with a private key.

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

Cryptographic Hash Function

A

A function that produces a fixed-length output (hash) from input data, used to ensure data integrity.

17
Q

Preimage Resistance

A

It should be difficult to find the original input data given the hash value.

18
Q

Second Preimage Resistance

A

It should be difficult to find another input that produces the same hash value as a given input.

19
Q

Strong Collision Resistance

A

It should be difficult to find any two different inputs that produce the same hash value.