Explore topic-wise MCQs in Cryptography and Network Security.

This section includes 17 Mcqs, each offering curated multiple-choice questions to sharpen your Cryptography and Network Security knowledge and support exam preparation. Choose a topic below to get started.

1.

Among the registers ‘a’ to ‘h’ how many involve permutation in each round?

A. 4
B. 5
C. 6
D. 3
Answer» D. 3
2.

What does the figure represent?

A. Compression function
B. Message digest generation using SHA
C. Elementary SHA operation for single round
D. Processing of a single 1024 bit blockView Answer
Answer» D. Processing of a single 1024 bit blockView Answer
3.

The output of the N 1024-bit blocks from the Nth stage is

A. 512 bits
B. 1024 bits
C. N x 1024bits
D. N x 512 bits
Answer» B. 1024 bits
4.

In the SHA-512 processing of a single 1024- bit block, the round constants are obtained

A. by taking the first 64 bits of the fractional parts of the cube roots of the first 80 prime numbers
B. by taking the first 64 bits of the fractional parts of the cube roots of the first 64 prime numbers
C. by taking the first 64 bits of the fractional parts of the square roots of the first 80 prime numbers
D. by taking the first 64 bits of the non-fractional parts of the first 80 prime numbers
Answer» B. by taking the first 64 bits of the fractional parts of the cube roots of the first 64 prime numbers
5.

In SHA-512, the registers ‘a’ to ‘h’ are obtained by taking the first 64 bits of the fractional parts of the cube roots of the first 8 prime numbers.

A. True
B. False
Answer» C.
6.

The message in SHA-512 is padded so that it’s length is

A. 832 mod 1024
B. 768 mod 1024
C. 960 mod 1024
D. 896 mod 1024
Answer» E.
7.

IN_THE_SHA-512_PROCESSING_OF_A_SINGLE_1024-_BIT_BLOCK,_THE_ROUND_CONSTANTS_ARE_OBTAINED?$

A. by taking the first 64 bits of the fractional parts of the cube roots of the first 80 prime numbers
B. by taking the first 64 bits of the fractional parts of the cube roots of the first 64 prime numbers
C. by taking the first 64 bits of the fractional parts of the square roots of the first 80 prime numbers
D. by taking the first 64 bits of the non-fractional parts of the first 80 prime numbers
Answer» B. by taking the first 64 bits of the fractional parts of the cube roots of the first 64 prime numbers
8.

The_output_of_the_N_1024-bit_blocks_from_the_Nth_stage_is$

A. 512 bits
B. 1024 bits
C. N x 1024bits
D. N x 512 bits
Answer» B. 1024 bits
9.

Compression_function

A. Message digest generation using SHA
B. Elementary SHA operation for single round
C. Processing of a single 1024 bit block
Answer» D.
10.

What is the size of W (in bits) in the SHA-512 processing of a single 1024- bit block?

A. 64
B. 128
C. 512
D. 256
Answer» B. 128
11.

In SHA-512, the registers ‘a’ to ‘h’ are obtained by taking the first 64 bits of the fractional parts of the cube roots of the first 8 prime numbers.$

A. True
B. False
Answer» C.
12.

The big-endian format is one in which

A. the least significant byte is stored in the low-address byte position
B. the least significant byte is stored in the high-address byte position
C. the most significant byte is stored in the high-address byte position
D. the most significant byte is stored in the low-address byte position
Answer» E.
13.

The message in SHA-512 is padded so that it’s length is$

A. 832 mod 1024
B. 768 mod 1024
C. 960 mod 1024
D. 896 mod 1024
Answer» E.
14.

What is the maximum length of the message (in bits) that can be taken by SHA-512?

A. 2<sup>128</sup>
B. 2<sup>256</sup>
C. 2<sup>64</sup>
D. 2<sup>192</sup>
Answer» B. 2<sup>256</sup>
15.

In SHA-512, the message is divided into blocks of size ___ bits for the hash computation.

A. 1024
B. 512
C. 256
D. 1248
Answer» B. 512
16.

What is the number of round computation steps in the SHA-256 algorithm?

A. 80
B. 76
C. 64
D. 70
Answer» D. 70
17.

SHA-1 produces a hash value of

A. 256 bits
B. 160 bits
C. 180 bits
D. 128 bits
Answer» C. 180 bits