The purpose of the ___________ algorithm is to enable two users to securely exchange a key that can then be used for subsequent encryption of messages.
Fill in the blank(s) with the appropriate word(s).
Diffie-Hellman key exchange
You might also like to view...
Find the errors in the following class and explain how to correct them:
``` class Example { public: Example( int y = 10 ) : data( y ) { // empty body } // end Example constructor int getIncrementedData() const { return data++; } // end function getIncrementedData static int getCount() { cout << "Data is " << data << endl; return count; } // end function getCount private: int data; static int count; }; // end class Example ```
If Kruskal’s algorithm is used for finding the minimum spanning tree of a weighted graph with n vertices and m edges and edge weights are already given in a sorted list, then, what will be the time complexity to compute the minimum cost spanning tree given that the union and find operations take amortized O(1)?
a. O(m) b. O(n) c. O(n logm) d. O(m logn)