Alice and Bob want to use Diffie-Hellman Key Establishment to share a key and they have agreed to use the prime number p=97 as their modulus. They have to choose their g from the following list of numbers, none which are unfortunately primitive roots: 6, 9, 18 Sort these numbers in the order of suitability, putting the most suitable on the left. Select one: a. 18, 6, 9 b. 9, 18, 6 c. 18, 9, 6 d. 6, 18, 9 e. 9, 6, 18

Q: Q2: Search a problem consists of four juice bottles A, B, C, and D (Sol, Moon, Costa, and Dad). They…

A: given data

Q: Consider the definition of Fibonacci series: where Fo = 0, F1 = 1, F2 = 1, and the recursive term is…

A: Answer:

Q: Answer question 1. There are two algorithms given in pseudo code.

A: Answer: Given: SP(x,n). Two parameters: x - non-zero real numbers - {-2,-1,0,1,2,....} n - natural…

Q: 10. Let K be your birth year and let N be your 7-digit phone number. Use Euclid's Algorithm to find…

A: 10.

Q: The chef is getting bored with the recent lockdowns caused by the coronavirus epidemic. After some…

A: Answer is in next step.

Q: Four people start on one side to cross a wobbly bridge. 17 minutes to complete. One candle,…

A: The bridge crossing problem is a classic puzzle that involves finding the optimal way to move a…

Q: Which is true about bubble sort? O All options are correct After the first pass, the element with…

A: 1)Bubble Sort is the simplest sorting algorithm which works by repeatedly swapping the adjacent…

Q: The chef is getting bored with the recent lockdowns caused by the coronavirus epidemic. After some…

A: Algorithm:The first line of the input contains a single integer TT indicating the number of test…

Q: move is made by Alice, the second — by Bob, the third — by Alice, etc. During their turn, the player…

A: Here have to determine about program for chips on board game problem statement.

Q: 8 Suppose the function x+1 = (ax+c) mod m is used to generate pseudo random number. Assume:…

A:

Q: 3. Read from Figure 1: Turing Machine 1 the description of turing machine and for how many steps…

A: The complete answer is below:

Q: 1. Consider the following program: (a) What is the recurrence relation? T(n)= if n l: Algorithm int…

A: For question number a, T(n) = 1, if n<=1 Explanation - As it is returning 1 in the base case so…

Q: 4. When the receiver recives your message, how are they recovering the original message?

A: Lester S. Hill developed the Hill Cipher in the early twentieth century as a cryptographic method to…

Q: Question 3: time complexity of Algori Question 4: You are studying for some mathematics competition…

A: Step 1: input three user input number. Step2: Add three numbers to list. Step 3: Using max()…

Q: The chef is getting bored with the recent lockdowns caused by the coronavirus epidemic. After some…

A: Algorithm:The first line of the input contains a single integer TT indicating the number of test…

Q: Q4. Eliminate immediate left recursion and left factoring for the productions below if any.

A: Given : E → int | int + E | int - E | E - (E)   Left Recursion: A grammar is left recursive if it…

Q: The positive numbers can be envisioned as opening sections and the negative numbers as shutting…

A: Answer: Here language is not specify . so I have code in C++ programming language and I have…

Q: each progression you pick some integer k>0, take the top k cards from the first deck and submit…

A: Here have to determine about the characterize a request for a deck programming problem statement.

Q: 11. Let n is a positive integer. Prove that n is even if and only if 3n²+1 is odd. (Hint: you must…

A: Using a demonstration by contraposition, we will assume the negative of the conclusion and…

Q: 8(g, e) = q 8(q, xa) = S(8(q, x), a) prove that 8(q, ry) = 8(8(q, r), y) using induction.

A: statement is true for a base case and then show that if it is true for some arbitrary value of n, it…

Q: 1. clearly how the function is evaluated and the return of the function for every recursive step as…

A:

Q: Jsing a repetition construct, display the following on the screen (warm-up problem).

A: The program for the above-given question is below:

Q: please write your own code with some commentary. Thank you

A: Python Code:- def bcd(x,y):    if x< y:         (x,y) = (y,x)    if(x%y) == 0:        return y…

Q: Fibonacci sequence is given by the recursive relation: F(0) = 1 and F(1) = 1 F(n) = F(n-1) + F(n-2)…

A: Define a recursive function fibonacci(n) to calculate the Fibonacci number for a given value of…

Q: TM M = (Q, E, I, 8, 90, 9a, gr), where Q = {90, 91, 92, 9a, ¶r}, Σ = {0, 1}, T = {0, 1, L}, and 8…

A: Answer

Q: a. Correctness of dynamic programming algorithm: Usually, a dynamic programming algorithm can be…

A: “Since you have posted multiple questions, we will provide the solution only to the first question…

Q: (encryption): Elgamal public key cryptosystem Start with the prime p 17 and the primitive root g =…

A: Here below i explain to find (c1,c2):…