Modular Exponentiation MCQ

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

• Determine the value of x, where y = 7, e = 12 and n = 566 using modular exponentiation method (x ≡ ye (mod n)).
  ক

  735

  খ

  321

  গ

  872

  ঘ

  487
• In cryptography system, the value of z in x ≡ ze (mod m) should be at least ______
  ক

  1024 bits

  খ

  1GB

  গ

  596 bits

  ঘ

  54 Bytes
• According to congruence relation, find the remainder of 56 mod 24.
  ক

  10

  খ

  12

  গ

  6

  ঘ

  8
• The time complexity to perform the modular exponentiation of a ≡ cg (mod m).
  ক

  O(m+]

  খ

  O(a*g)

  গ

  O(gm)

  ঘ

  O(g)
• Evaluate the expression 6359 mod 320.
  ক

  681

  খ

  811

  গ

  3781

  ঘ

  279
• If there is a unique prime number p1 then a finite field F has the property of ______________
  ক

  p1x = 0 for all x in F

  খ

  f(x) = f(xp1) for all x in F

  গ

  p1 = y for all y in F

  ঘ

  xy + p1 for all x, y in F
• Which of the following methods uses the concept that exponentiation is computationally inexpensive in the finite field?
  ক

  Diffie-HEllman key exchange

  খ

  RSA key exchange

  গ

  Arithmetic key exchange

  ঘ

  FSM method
• Which of the following algorithms has better computational complexity than standard division algorithms?
  ক

  Montgomery algorithm

  খ

  Classical modular exponentiation algorithm

  গ

  ASM algorithm

  ঘ

  FSM algorithm
• A multiplicative monoid defines the property of exponentiation with ________
  ক

  integer exponents

  খ

  fractional exponents

  গ

  rational exponents

  ঘ

  negative integer exponents
• If the multiplicative inverse of “53 modulo 21” exists, then which of the following is true?
  ক

  GCD(53,21) = 1

  খ

  GCD(53,21) = 29

  গ

  GCD(53,21) = 53

  ঘ

  GCD(53,21) = 12