Chapter 7 Flashcards

1
Q

HSM (Hardware Security Module)

A

Provides security management for crypto keys and is used to provide crypto keys for activities such as encryption, decryption, and authentication.

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

RADIUS (Remote Authentication Dial In User Service)

A

A remote server used for authenticating network users for WPA2-Enterprise wireless networks.

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

Cryptography

A

The practice of encoding information in a manner that it cannot be decoded without access to the required decryption key.

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

Cipher

A

A method used to scramble or obfuscate characters to hide their value

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

Substitution Cipher

A

A type of coding or ciphering system that changes one character or symbol into another.

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

Polyalphabetic Substitution Cipher

A

Using multiple alphabets as a substitution cipher for the same message

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

Transposition Cipher

A

Transposing or scrambling the letters in a certain manner.

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

Steganography

A

The art of using cryptographic techniques to embed secret messages withing another file.

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

Nonrepudiation

A

Provides assurance to the recipient that the message was originated by the sender and not someone masquerading as the sender.

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

Symmetric Key Weaknesses

A

Key distribution
No nonrepudiation
Not scalable
Keys must be regenerated often

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

Symmetric Key Algorithms

A

Use a shared secret key that is distributed to all members who participate in the communications.

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

Asymmetric Key Algorithms

A

Each user has two keys: a public key, which is shared with all users, and a private key which is kept secret and known only to the owner of the keypair.

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

Asymmetric Key Strengths

A

Addition of new users only require a generation of one public-private key pair.
Users can be easily removed.
Key regeneration is only necessary when private key is compromised.
Distribution is simple.
Ensures integrity, authentication, and nonrepudiation.
No preexisting communication link needs to exist.

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

DES (Data Encryption Standard)

A

A proposed standard cryptosystem for all government communications.

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

ECB (Electronic Cookbook) Mode

A

Each time the algorithm processes a 64-bit block, it simply encrypts the block using the chosen secret key.

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

CBC (Cipher Block Chaining) Mode

A

Each block of unencrypted text is combined with the block of ciphertext immediately preceding it before it is encrypted using the DES algorithm.

17
Q

CFB (Cipher Feedback) Mode

A

Uses CBC to encrypt data produced in real time.

18
Q

OBF (Output Feedback) Mode

A

Operates the same as CFB but instead of XOR’ing the encrypted version of the previous block of ciphertext, it XOR’s the plain text with a seed value.

19
Q

CTR (Counter) Mode

A

Instead of using a seed value for each encryption/decryption, it uses a simple counter that increments for each operation.

20
Q

Offline Distribution of Secret Keys

A

Involves the physical exchange of secret keys.

21
Q

Public Key Encryption

A

Involves the use of public key encryption between two parties to ensure authentication, once that is done an exchange of secret keys is done before switching back to the secret key algorithm.

22
Q

Diffie-Hellman

A

A secret key is calculated using randomly chosen values by two parties. Using the Diffie-Hellman Algorithm both parties will reach the same value which can then be used as the secret key.

23
Q

5 Requirements for Cryptographic Hash Function

A

Accept any input of length.
Produce an output of a fixed length, regardless of input length.
Hash value is relatively easy to compute.
The has function is one way.
The has function is collision free.

24
Q

SHA (Secure Hash Algorithm)

A

Government standard hash functions promoted by NIST (National Institute of Standards and Technology)

25
Q

Digital Signature System

A

Assure the recipient that the message truly came from the sender.
Assure the recipient that the message was not altered.

26
Q

HMAC (Hashed Message Authentication Code)

A

Implements a partial digital signature that guarantees the integrity but does not provide nonrepudiation.

27
Q

PKI (Public Key Infrastructure)

A

A system for the creation, storage, and distribution of digital certificates which are used to verify that a particular public key belongs to a certain entity.

28
Q

Digital Certificates

A

Provide communicating parties with the assurance that the people they are communicating with are truly who they claim to be.

29
Q

CA (Certificate Authorities)

A

These organizations offer notarization services for digital certificates.

30
Q

RA (Registration Authorities)

A

Assist CA’s with verifying users’ identities prior to issuing digital certificates but do not issue the certificates themselves.