Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

07 - Spring 2019 - CET-2830C_Information Security > Chapter 03 Quiz – Basic Cyprography > Flashcards

Chapter 03 Quiz – Basic Cyprography Flashcards

Questions 20

1
Q

Question # 01

The XOR cipher is based on the binary operation eXclusive OR that compares two bits.

a. True
b. False

A

a. True

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

Question # 02

In information technology, non-repudiation is the process of proving that a user performed an action.

a. True
b. False

A

a. True

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

Question # 03

A collision attack is an attempt to find two input strings of a hash function that produce the same hash result.

a. True
b. False

A

a. True

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

Question # 04

If using the MD5 hashing algorithm, what is the length to which each message is padded?

a. 32 bits
b. 64 bits
c. 128 bits
d. 512 bits

A

d. 512 bits

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

Question # 05

Which type of cryptographic algorithm takes an input string of any length, and returns a string of any requested variable length?

a. substitution
b. block
c. loop
d. sponge

A

d. sponge

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

Question # 06

After the DES cipher was broken and no longer considered secure, what encryption algorithm was made as its successor?

a. AES
b. Twofish
c. 3DES
d. RSA

A

c. 3DES

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

Question # 07

Which of the following is not one of the functions of a digital signature?

a. verification of the sender
b. prevention of the sender from disowning the message
c. prove the integrity of the message
d. protect the public key

A

d. protect the public key

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

Question # 08

Which of the following asymmetric cryptography algorithms is most commonly used?

a. AES
b. RSA
c. Twofish
d. Blowfish

A

b. RSA

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

Question # 09

What widely used commercial asymmetric cryptography software can be used for encrypting files and email messages?

a. PGP
b. GPG
c. EFS
d. GNUPG

A

a. PGP

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

Question # 10

The SHA-1 hashing algorithm creates a digest that is how many bits in length?

a. 96 bits
b. 128 bits
c. 160 bits
d. 192 bits

A

c. 160 bits

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

Question # 11

What type of cipher takes one character and replaces it with one character, working one character at a time?

a. block cipher
b. single cipher
c. unit cipher
d. stream cipher

A

d. stream cipher

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

Question # 12

What term describes data actions being performed by endpoint devices, such as printing a report from a desktop computer?

a. data-in-transit
b. data-in-play
c. data-at-rest
d. data-in-use

A

d. data-in-use

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

Question # 13

What alternative term can be used to describe asymmetric cryptographic algorithms?

a. user key cryptography
b. public key cryptography
c. private key cryptography
d. cipher-text cryptography

A

b. public key cryptography

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

Question # 14

Which of the following are considered to be common asymmetric cryptographic algorithms? (Choose all that apply.)

a. Data Encryption Standard
b. Elliptic Curve Cryptography
c. Advanced Encryption Standard
d. Digital Signature Algorithm

A

b. Elliptic Curve Cryptography

d. Digital Signature Algorithm

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

Question # 15

Which key exchange requires Alice and Bob to each agree upon a large prime number and related integer?

a. Quantum Prime
b. Prime-Curve
c. Diffie-Hellman
d. Elliptic Curve Diffie-Hellman

A

c. Diffie-Hellman

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

Question # 16

Ciphertext is the scrambled and unreadable output of encryption.

a. True
b. False

A

a. True

17
Q

Question # 17

Obfuscation is making something well known or clear.

a. True
b. False

A

b. False

18
Q

Question # 18

Which of the following is a public key system that generates random public keys that are different for each session?

a. ephemeral-secrecy
b. perfect forward secrecy
c. public secrecy
d. random-key exchange

A

b. perfect forward secrecy

19
Q

Question # 19

What four basic protections can cryptography support?

A

Cryptography can support confidentiality, integrity, authentication, and non-repudiation.

20
Q

Question # 20

What is meant by the phrase “security through obscurity,” and why is this concept not accurate?

A

Security through obscurity, or the notion that virtually any system can be made secure so long as outsiders are unaware of it or how it functions.

However, this is a flawed approach since it is essentially impossible to keep “secrets” from everyone.

07 - Spring 2019 - CET-2830C_Information Security (7 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions