Q. Out of following which one is Mersenne Primes?

View solution

Q. Out of the following which of these integers is not prime?

View solution

Q. The prime factorization of 1001 is __________

View solution

Q. Which positive integer less than 21 are relatively prime to 21?

View solution

Q. Is 7, 8, 9, 11 are pairwise relatively prime.

View solution

Q. The greatest common divisor of 3¹³.5¹⁷ and 2¹².3⁵ is __________

View solution

Q. The greatest common divisor of 0 and 5 is ___________

View solution

Q. The lcm of 3 and 21 is ________ if gcd(3,21)=3.

View solution

Q. The least common multiple of 41.42 and 42.41 is ____________

View solution

Q. If the multiplicative inverse of “53 modulo 21” exists, then which of the following is true?

View solution

Q. A multiplicative monoid defines the property of exponentiation with ________

View solution

Q. Which of the following algorithms has better computational complexity than standard division algorithms?

View solution

Q. Which of the following methods uses the concept that exponentiation is computationally inexpensive in the finite field?

View solution

Q. If there is a unique prime number p₁ then a finite field F has the property of ______________

View solution

Q. Evaluate the expression 6359 mod 320.

View solution

Q. The time complexity to perform the modular exponentiation of a ≡ cᵍ (mod m).

View solution

Q. According to congruence relation, find the remainder of 56 mod 24.

View solution

Q. In cryptography system, the value of z in x ≡ zᵉ (mod m) should be at least ______

View solution

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

View solution

Q. How many bytes of the secret key is generated using Diffie-Hellman encryption/decryption scheme?

View solution