Domain 3 Flashcards

1
Q

_____, are always meant to hide the true meaning of a message.

A

Cyphers

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

Cryptographic systems of symbols that operate on words or phrases and are sometimes secret but don’t always provide confidentiality

A

Code

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

is a symmetric key cipher where plaintext digits are combined wit pseudorandom cipher digit stream(keystream). In a _____ _____, each plaintext digit is encrypted one at a time with the corresponding digit of the keystream, to give a digit of the cipher text stream.

A

Stream Cypher

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

is a method of encrypting text (to produce ciphe rtext) in which a cryptographic key and algorithm are applied to a block of data(for example, 64 contiguous bits) at once as a group rather than to one bit at a time

A

Block Cypher

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

is a method of encrypting in which units of plaintext are replaced with the ciphertext, in a defined manner, with the help of a key; the “units” may be single letters (the most common), pairs of letters, triplets of letters, mixtures of the above, and so forth.

A

Substitution

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

uses an encryption algorithm to rearrange the letters of a plaintext message, forming the ciphertext message.

A

Transposition

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

is a random bit string (a nonce) that is the same length as the block size that is XORed with the message. ___ are used to create a unique cipher text every time the same message is encrypted with the same key.

A

Initialization Vector (IV)

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

This stream cypher uses a key of length one

A

Ceasar

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

This stream cypher uses a longer key (Usually a word or sentence)

A

Vigenere

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

This stream cypher uses a key that is as long as the message itself

A

One-time pad

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

One Time Pad Success Factors (4)

A

The key must be generated randomly without any known pattern.
At least as long as the message to be encrypted.
The pads must be protected against physical disclosure
Each pad must be used only one time and then discarded

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

____________ is a communication concept. A specific type of information is exchanged, but no real data is transferred, as with digital signatures and digital certificates.

A

Zero-knowledge proof

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

A concept that enabled one to prove knowledge of a fact to another individual without revealing the fact it itself.

A

Zero-knowledge proof

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

Which concept ensures that no single person has sufficient privileges to compromise the security of the environment

A

Split knowledge

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

_____ ______ means that the information or privilege required to perform an operation is divided among multiple users.

A

Split knowledge

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

is a way to measure the strength of a cryptography system by measuring the effort in terms of cost and/ or time to decrypt messages.

Also know as the time and effort required to break a protective measure

A

Work function or work factor

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

Modern cryptosystems utilize keys that are at least ____ bits long to provide adequate security

A

128

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

Relies on the use of a shared secret key. Lacks support for scalability, easy key distribution, and nonrepudiation

A

Symmetric Encryption

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

Public-private key pairs for communication between parties. Supports scalability, easy key distribution, and nonrepudiation

A

Asymmetric Encryption

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

Which DES or 3DES mode is the Simplest & least secure mode. Processes 64-bit blocks, encrypts block with the chosen key. If same block encountered multiple times, same encrypted block is produced, making it easy to break

A

Electronic Codebook Mode (ECB)

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

Using this DES or 3DES mode, Each block of unencrypted text is XORed with the block of ciphertext immediately preceding. Decryption process simply decrypts ciphertext and reverses the XOR operation.

A

Cipher Block Chaining (CBC)

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

This DES or 3DES mode is the streaming version of CBC. Works on data in real time, using memory buffers of same block size. When buffer is full, data is encrypted and transmitted. Uses chaining, so errors propagate.

A

Cipher Feedback (CFB)

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

This DES or 3DES mode operates similar to CFB, but XORs the plain text with a seed value. No chaining function, so errors do not propagate.

A

Output Feeback (OFB)

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

This DES or 3DES mode uses an incrementing counter instead of a seed. Errors do not propagate.

A

Counter (CTR)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
A Weakness in cryptography where a plain-text message generates identical ciphertext messages using the same algorithm but using different keys.
Key Clustering
26
Good hash functions have five requirements:
1. They must allow input of any length. 2. Provide fixed-length output. 3. Make it relatively easy to compute the hash function for any input. 4. Provide one-way functionality. 5. Must be collision free.
27
Adding salts to the passwords before hashing them reduces the effectiveness of _____ _____ attacks.
Rainbow tables
28
Digital Signature standards or DSS work in conjuction with which 3 encryption algorithms ?
Digital Signature ALgorithm (DSA) Rivest Shamir ALderman (RSA) Elliptic curve DSA (ECDSA)
29
Certificate authorities (CAs) generate digital certificates containing the public keys of system users. Users then distribute certificates to people with whom they want to communicate. Certificate recipients verify a certificate using the ___ _____ ____.
CA's public key
30
Which IPSEC mode encrypts the whole packet?
Tunnel mode
31
Protocols used by IPSEC
Authentication Header (AH) and Encapsulating Security Payload (ESP)
32
Which type of cryptographic attack attempts to randomly find the correct cryptographic key. Known plaintext, chosen ciphertext, and chosen plaintext attacks require the attacker to have some extra information in addition to the ciphertext.
Brute-force attack
33
____________ attack exploits protocols that use two rounds of encryption.
Meet in the middle attack
34
__________ attack fools both parties into communicating with the attacker instead of directly with each other
Man in the middle attack
35
__________ attack is an attempt to find collisions in hash functions.
Birthday attack
36
_________ attack is an attempt to reuse authentication requests.
Replay
37
Which symmetric algorithms have a 128 bit block size
AES, RC5, Two Fish
38
Which symmetric algorithm is a stream cypher
RC4
39
Which algorithms have a 64 bit block size?
Blowfish, DES, 3DES, IDEA, RC2, RC5, Skypjack
40
Key Size(s) of AES
128, 192, 256
41
Key Size(s) of Blowfish
32-448 key bit
42
Key Size of DES
56 bit
43
Key size of 3DES
112 or 168 bit
44
Key size of IDEA, RC2 and RC4
128 bit
45
Key size of RC5
0-2040 bit
46
Key size of Twofish
1-256 bit
47
Which hash algorithm has a variable hash value length?
HMAC
48
What is are the possible hash value length of HAVAL hash algorithm?
128, 160, 192, 224, 256
49
What is the hash value length of MD2, MD4, and MD5
128
50
SHA-1 Hash value length
160
51
What are the possible hash value length of SHA-2?
224, 256, 384, 512
52
is the most famous public key cryptosystem; it was developed by ________ in 1977. It depends on the difficulty of factoring the product of prime numbers.
RSA
53
is an extension of the Diffie-Hellman key exchange algorithm that depends on modular arithmetic.
El Gamal
54
Algorithm depends on the ______ _____ discrete logarithm problem and provides more security than other algorithms when both are used with keys of the same length.
Elliptic curve
55
Digital Signatures Rely on public key cryptography and hashing functions. DS algorithms suitable for use in FIPS 186-4 (the Digital Signature Standard) must use ____ hashing functions
SHA-2
56
What are the 3 approved digital signature encryption algorithms?
DSA, RSA and Elliptic Curve DSA (ECDSA)
57
Rank the following algorithms in terms of strength: El Gamal, Diffie-Hellman, ECC and RSA
Diffie Hellman, RSA, El Gamal, ECC
58
This asymmetric algorithm replaced Diffie Hellman
El Gamal
59
Security models focused on integrity
Biba Clark-Wilson (Access control triple) Goguen- Meseguer (Non interference model) Sutherland (Preventing interference)
60
Security models focused on confidentiality
Bell-Lapadula (no read up no write down) Brewer and Nash (aka chinese wall) Take Grant
61
Which security model uses a lattice
Biba Model
62
Which security model is used by the government?
Bell-Lapadula
63
Which model is "No read up, no write down"
Bell Lapadula
64
What property describes " no read up"?
Simple security property
65
What property describes " no write down" ?
Star * security property
66
What property describes " no read down"?
Simple integrity property
67
What property describes " no write up" ?
star * integrity property
68
also called the”Chinese Wall model”. It was developed to prevent conflict of interest (COI) problems.(confidentiality-based)
Brewer and Nash Model
69
another confidentiality-based model that supports four basic operations: take, grant, create, and revoke.
Take Grant Model
70
This model uses a formal set of protection rules for which each object has an owner and a controller. It is focused on the secure creation and deletion of both subjects and objects. A collection of eight primary protection rules or actions that define the boundaries of certain secure actions.
Graham-Denning
71
What is Zachman an example of?
Enterprise security model
72
What is Sabsa an example of?
Enterprise security model
73
What is TOGAF an example of?
Enterprise security model
74
What security includes confidentiality and integrity?
Lipner security model
75
Defines 3 goals of integrity? Access Triple
Clark-Wilson
76
What is NIST 800-53?
Security and privacy controls us federal agencies
77
What is COSO primarily focused on?
Financial Controls
78
What is NIST 800-37?
Risk Management Framework
79
What is knows as the Orange Book?
TCSEC
80
Which level of the Common Criteria is "Formally verified, designed and tested"
EAL7
81
Which level of the Common Criteria is "Functionality tested"
EAL1
82
Which level of the Common Criteria is "Structurally tested"
EAL2
83
Which level of the Common Criteria is "Methodically tested and checked"
EAL3
84
Which level of the Common Criteria is "Methodically designed, tested and reviewed"
EAL4
85
Which level of the Common Criteria is "Semi formally designed and tested"
EAL5
86
Which level of the Common Criteria is "Semi formally verified, designed and tested"
EAL6
87
Which level of the Common Criteria is "Formally verified, designed and tested"
EAL7
88
What design principle is the combination of hardware, software, and controls that work together to form a trusted base to enforce your security policy
TCB (Trusted Computing Base)