Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

IAS QUIZ 11

Total questions: 25

Worksheet time: 13mins

Name
Class
Date
1.

Virtually all cryptographic hash functions involve the iterative use of a compression function.

a)

T

b)

F

2.

Limited characteristics make it impossible for hash functions to be used to determine whether or not data has changed.

a)

F

b)

T

3.

Hash functions can be used for intrusion and virus detections.

a)

T

b)

F

4.

The cryptographic hash function is not a versatile cryptographic algorithm.

a)

F

b)

T

5.

it is possible to use a hash function but no encryption for message authentication.

a)

T

b)

F

6.

Hash functions are commonly used to create a one-way password file.

a)

T

b)

F

7.

A weak hash function is sufficient to protect against an attack in which one party generates a message for another party to sign.

a)

T

b)

F

8.

The way to measure the resistance of a hash algorithm to cryptanalysis is to compare its strength to the effort required for a

        brute-force attack.

a)

T

b)

F

9.

It can be shown that some form of birthday attack will succeed against any hash scheme involving the use of cipher block         chaining without a secret key, provided that either the resulting hash code is small enough or that a larger hash code can be

        decomposed into independent subcodes.

a)

T

b)

F

10.

The most widely used hash function has been the Whirlpool.

a)

F

b)

T

11.

Big-endian format is the most significant byte of a word in the low-address byte position.

a)

T

b)

F

12.

Encryption hardware is optimized toward smaller data sizes.

a)

F

b)

T

13.

Whirlpool is a popular cryptographic hash function

a)

T

b)

F

14.

A good hash function has the property that the results of applying the function to a large set of inputs will produce outputs that are

      evenly distributed and apparently random.

a)

T

b)

F

15.

The principal object of a hash function is __________.

a)

data integrity

b)

compression

c)

mapping messages

d)

collision resistance

16.

A ___________ accepts a variable length block of data as input and produces a fixed size hash value h = H(M).

a)

hash function

b)

hash resistance

c)

hash value

d)

hash code

17.

The Secure Hash Algorithm design closely models and is based on, the hash function __________ .

a)

MD4

b)

MD5

c)

FIPS 180

d)

RFC 4634

18.

A ___________ is an algorithm for which it is computationally infeasible to find either (a) a data object that maps to a pre-specified hash result or (b) two data objects that map to the same hash result.

a)

cryptographic hash function

b)

One-way hash function

c)

strong collision resistance

d)

compression function

19.

The cryptographic hash function requirement that guarantees that it is impossible to find an alternative message with the same hash value as a given message and prevents forgery when an encrypted hash code is used is the ___________.

a)

second preimage resistant

b)

Collision resistant

c)

pseudorandomness

d)

preimage resistant

20.

__________ is a mechanism or service used to verify the integrity of a message.

a)

Message authentication

b)

Data compression

c)

Data mapping

d)

Message digest

21.

Message authentication is achieved using a __________.

a)

MAC

b)

DES

c)

MDF

d)

SHA

22.

__________ are measures of the number of potential collisions for a given hash value.

a)

Primitives

b)

MACs

c)

Hash codes

d)

Preimages

23.

A hash function that satisfies the properties of variable input size, fixed output size, efficiency, preimage resistance, and second preimage resistance is referred to as a __________.

a)

weak hash function

b)

strong hash function

c)

collision resistant function

d)

preimage resistant function

24.

The effort required for a collision-resistant attack is explained by a mathematical result referred to as the ___________.

a)

birthday paradox

b)

Whirlpool

c)

hash value

d)

message authentication code

25.

The SHA-512 algorithm has the property that every bit of the hash code is a function of every bit of the input.

a)

T

b)

F