Exams › GATE › Technical
Consider that B wants to send a message m that is digitally signed to A. Let the pair of private and public keys for A and B be denoted by K_A⁻ and K_A⁺ for x = A,B, respectively. Let Kₓ(m) represent the operation of encrypting m with a key Kₓ and H(m) represent the message digest. Which one of the following indicates the CORRECT way of sending the message m along with the digital signature to A?
- {m, K_B^+(H(m))}
- {m, K_B^-(H(m))}
- {m, K_A^-(H(m))}
- {m, K_A^+(m)}
Correct answer: {m, K_B^-(H(m))}
Solution
The correct option is right because B needs to sign the message digest H(m) using their private key K_B⁻, which allows A to verify the signature using B's public key K_B⁺. This ensures the authenticity and integrity of the message.
Related GATE Technical questions
- We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to implement this counter is
- A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)?
- Consider the following C program.
void f(int, short);
void main()
{
int i = 100;
short s = 12;
short *p = &s;
________; // call to f()
}
Which one of the following expressions, when placed in the blank above, will NOT result in a type checking error?
- The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
- Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE?
P: Minimum spanning tree of G does not change
Q: Shortest path between any pair of vertices does not change
- Consider the following C program.
#include<stdio.h>
void mystery(int *ptra, int *ptrb) {
int *temp;
temp = ptrb;
ptrb = ptra;
ptra = temp;
}
int main() {
int a=2016, b=0, c=4, d=42;
mystery(&a, &b);
if (a < c)
mystery(&c, &a);
mystery(&a, &d);
printf("%d
", a);
}
The output of the program is _________.
⚔️ Practice GATE Technical free + battle 1v1 →