Chapter 2 Flashcards

1
Q

Universal technique for providing confidentiality for transmitted/stored data

A

Symmetric Encryption

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

Need strong encryption algorithm

Sender and receiver must have obtained copies of the secret key

A

2 requirements for Symmetric Encryption

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

Cryptanalytic attacks

Brute-Force attack

A

Attacking Symmetric Encryption

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

Rely on nature of algorithm

Knowledge of general characteristics of plain text

A

Cryptanalytic attacks

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

Try all possible keys on ciphertext until plaintext is obtained

A

Brute-force attack

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

Most widely used encryption scheme

Uses 64 bit plaintext block and 56 bit key to produce 64 bit ciphertext block

A

Data Encryption Standard (DES )

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

Repeats DES algorithm 3 times using 2 or 3 unique keys
Pros: 168 bit key length overcomes vulnerability to brute-force
Cons: algorithm is sluggish in software
64 bit block size

A

Triple DES (3DES)

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

Replaced 3DES
Symmetric block cipher
Improved efficiency

A

Advanced Encryption Standard (AES)

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

Typical symmetric encryption is applied to a unit of data larger than a single 64 bit or 128 bit block

A

Practical Security Issues

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

Simplest approach to multiple-block encryption

A

Electronic codebook (ECB) mode

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

Processes the input one block of elements at a time
can reuse keys
More common

A

Block Cipher

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

Processes the input elements continuously
Produces output one element at a time
Encrypts plaintext one byte at a time

A

Stream Cipher

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

Protects against active attacks
Verifies received message is authentic
Can use conventional encryption

A

Message Authentication

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

Can be applied to block of data of any size
Produces a fixed-length output
One-way or pre-image resistant

A

Hash function requirements

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

Cryptoanalysis - exploit logical weaknesses in the algorithm

Brute-force attack - strength of hash function depends solely on the length of the hash code

A

2 approaches to attacking a secure hash function

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

SHA most widely used algorithm

A

Security of Hash functions

17
Q

Passwords

Intrusion detection

A

Additional Secure hash functions

18
Q

Based on mathematical functions

Asymmetric - uses 2 separate keys

A

Public-key Encryption Structure

19
Q

Computationally easy:
- to create key pairs
- for sender knowing public key to encrypt messages
- for receiver knowing private key to decrypt ciphertext

A

Requirements for public-key cryptosystems

20
Q

RSA
Diffie-Hellman key exchange algorithm
Digital Signature Standard (DSS)
Elliptic curve Cryptography(ECC)

A

Assymmetric Encryption Algorithms

21
Q

Used for authenticating both source and data integrity

A

Digital Signatures

22
Q

Protects a message without needing to first arrange for sender and receiver to have same secret key

A

Digital Envelopes

23
Q

Keys for public-key algorithms

- stream key for symmetric stream cipher

A

Random Numbers

24
Q

Randomness - uniform distribution; independence

Unpredicatability - each number is statistically independent of other numbers

A

Random Number Requirements

25
Q

Cryptographic applications typically make use of algorithmic techniques for random number generation

A

Random vs Pseudorandom ( sequences produced that satisfy statistical randomness tests