Whirlpool Algorithm MCQ

Test your knowledge with important Whirlpool Algorithm MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Whirlpool Algorithm MCQs at Bissoy

• How many add round key functions are present in the Whirlpool algorithm?
  ক

  16

  খ

  18

  গ

  11

  ঘ

  10
• What is the size of the key in the algorithm?
  ক

  256 bits

  খ

  512 bits

  গ

  128 bits

  ঘ

  1024 bits
• Each round uses a different key in the algorithm.
  ক

  True

  খ

  False
• How many rounds does the Whirlpool algorithm undergo?
  ক

  12

  খ

  14

  গ

  10

  ঘ

  16
• Before the first round of the Whirlpool algorithm, which is the operation that takes place?
  ক

  Addition of Key

  খ

  Substitution of Bytes

  গ

  Mixing of Rows

  ঘ

  Shifting of Columns
• Which among the following has not been broken yet( still collision free)?
  ক

  MD-5

  খ

  SHA-1

  গ

  DES

  ঘ

  SHA-2
• Which algorithm has the most execution latency?
  ক

  SHA-1

  খ

  SHA-2

  গ

  MD-5

  ঘ

  Whirlpool
• Which hash algorithm is the most hardware intensive among the following?
  ক

  SHA-1

  খ

  SHA-2

  গ

  MD-5

  ঘ

  Whirlpool
• There’s no known successful attacks made against Whirlpool.
  ক

  True

  খ

  False
• Which of the following hexadecimal values are not present in the matrix C of the Mix Rows function?
  ক

  01

  খ

  09

  গ

  05

  ঘ

  03
• Mix Row functions operate on the 8 × 8 matrix (A) to form the new matrix. The operation can be considered to be B = AC. The matrix C is formed by
  ক

  each successive even row having left shifts

  খ

  each successive row having a left shifts

  গ

  each successive odd row having right shifts

  ঘ

  each successive row having a right shifts
• Which round provides linear diffusion in the Whirlpool Algorithm?
  ক

  Add Key

  খ

  Substitute Bytes

  গ

  Mix Rows

  ঘ

  Shift Rows
• How many XOR gate operations are involved in the S-box permutation?
  ক

  12

  খ

  8

  গ

  16

  ঘ

  4
• The 7th row in the 8 × 8 matrix undergoes a ___________ shift.
  ক

  6 bit

  খ

  6 byte

  গ

  7 bit

  ঘ

  7 byte
• When the Round Constant is given by S. What are the limits of ‘i’ and ‘j’?
  ক

  . What are the limits of ‘i’ and ‘j’? ] i = 1 ; 0 <= j <= 7

  খ

  8(r-1)+j

  গ

  8(r-1)+j

  ঘ

  8(r-1)+j
• The Round Constant is given by S. What are the limits of ‘r’?
  ক

  . What are the limits of ‘r’? ] 0 <= r <= 11

  খ

  8(r-1)+j

  গ

  8(r-1)+j

  ঘ

  8(r-1)+j
• The Round Constant is dependent on the s-box values.
  ক

  True

  খ

  False
• How many round constants (RCs) are required in Whirlpool?
  ক

  10

  খ

  11

  গ

  12

  ঘ

  21
• Another name for the Whirlpool key is
  ক

  CState

  খ

  LState

  গ

  Estate

  ঘ

  KState
• The S-box implements linear mapping thus providing diffusion.
  ক

  True

  খ

  False
• What is the size of the s-box table/matrix in Whirlpool?
  ক

  8 × 8

  খ

  16 × 16

  গ

  8 × 16

  ঘ

  16 × 8
• What is the correct order of operation within each round of the Whirlpool algorithm?
  ক

  Add round key, Substitute bytes, Mix rows, Shift columns

  খ

  Substitute bytes, Add round key, Shift columns, Mix rows

  গ

  Mix rows, Substitute bytes, Shift columns, Add round key

  ঘ

  Substitute bytes, Shift columns, Mix rows, Add round key
• Which one of these is not a Whirlpool function?
  ক

  Add Key

  খ

  Substitute Bytes

  গ

  Mix Rows

  ঘ

  Shift Rows
• How many rounds are there in one Whirlpool Iteration?
  ক

  3

  খ

  4

  গ

  6

  ঘ

  8
• The hash matrix of 8 × 8 is preferred over a 16 × 4 matrix because
  ক

  it is symmetric

  খ

  it is smaller in size

  গ

  it is faster in computation

  ঘ

  none of the mentioned
• The 8 × 8 hash matrix holds values of size
  ক

  16 bits

  খ

  32 bits

  গ

  8 bits

  ঘ

  4 bits
• The hash matrix is of the size
  ক

  16 × 8

  খ

  16 × 4

  গ

  8 × 8

  ঘ

  4 × 16
• The length of the message is appended to the message. What is the size of this length?
  ক

  256 bits

  খ

  512 bits

  গ

  128 bits

  ঘ

  1024 bits
• The message is padded to
  ক

  1024 bits

  খ

  512 bits

  গ

  Odd multiple of 256 bits

  ঘ

  Odd multiple of 512 bits
• Given a message and its n-bit hash result, the expected workload of finding a message that hashes to the same value is of the order _______________
  ক

  2(n/2)

  খ

  2(n-1)

  গ

  2(n)

  ঘ

  2(2n)