Explain, with examples, active communication skills

Discuss the skills involved in ending of session.

Analyse the common therapist traps

Alice wants to use the Digital Signature algorithm for signing messages. She chooses p = 83, q = 41, g = 2 and a = 3. Alice wants to sign the message M = 20. She chooses the secret value k = 8. Explain the procedure that Alice will use for computing the signature. What information will she send Bob?

Alice wants to use the ElGamal digital signature scheme with public parameters p = 47, α = 2, secret value a = 7 and β = 34. She wants to sign the message M = 20 and send it to Bob. She chooses k = 5 as the secret value. Explain the procedure that Alice will use for computing the signature of the message. What information will she send Bob?

Solve the discrete logarithm problem 5x ≡ 22 (mod 47) using Baby-Step, Giant-Step algorithm .

Explain how Bob will decrypt the message.

Alice wants to send Bob the message M = 15. She chooses k = 5. How will she compute the cipher text? What information does she send to Bob?

Bob uses ElGamal cyrptosystem with parameters p = 47, g = 5 and the secret value x = 3. What values will he make public?

Decrypt the message c = 23 that was encrypted using RSA algorithm with e = 43 and n = 77.

Apply runs test to the following sequence:
1001101000010000101111011
0111010010110110010011010
0110011100001100100111000
1100001101010111101001110
0010001111000001101010010
1000110100000110100101101
1110001001

Apply poker test to the following sequence with level of significane α = 0.05. (4) 1001101000010000101111011 01110100101101100100110.

Apply the frequency test, serial test and autocorrelation test to the following sequence at level of significance α = 0.05: 011001110000110010011100.

Find a recurrence that generates the sequence 110110110110110.

Considering the bytes 10001001 and 10101010 as elements of the field F2[X]/hg(X)i, where g(X) is the polynomial X 8 +X 4 +X 3 +X +1, find their product and quotient .

Decrypt the ciphertext 101000111001 which was encrypted with the Toy block cipher once using the key 101010010. Show all the steps.

In this exercise, we introduce you to Hill cipher. In this cipher, we convert our message to
numbers, just as in affine cipher. However, instead of encrypting character by character, we
encrypt pairs of characters by multiplying them with an invertible matrix with co-efficients in
Z26.
Here is an example: Suppose we want to ENCRYPT "ALLISWELL". Since we require the
plaintext to have even number of characters, we pad the message with the character ‘X’. We
break up the message into pairs of characters AL, LI, SW, EL and LX. We convert each pair of
characters into a pair elements in Z26 as follows:

Use Miller-Rabin test to check whether 75521 is a strong pseuodprime to the base 2.

Find the inverse of 13 (mod 51) using extended euclidean algorithm