Apply poker test to the following sequence with level of significane α = 0.05. (4) 1001101000010000101111011 01110100101101100100110.
To apply the poker test, we first need to divide the sequence into non-overlapping blocks of length 4 (since poker test commonly uses 4-bit blocks) and then classify them according to the number of distinct digits in each block. The sequence given is: ``` 1001 1010 0001 0000 _________ ____ ___ ___ ______ __________ ____ _______ ______ ____ _______.
__________ __________ _________ ____ ____ _________ ___ ____ _______.
_________ ____ ______ _____ _________.
_________ _____ ______ ___ _______ ___ _____ _______ ___ ______.
____ _____ ____ __________ __________.
__________ ____ _______ _____ ______ _________ ___ ____ _________ __________.
__________ ________ _____ ___ ___ _________.
______ ______ ___ ______ _________ ________ ______ ________ ____ ________ ____.
__________ _________ ____ __________ ___.
______ __________ __________ _____ _____.
_________ _________ _________ __________ ________ ________ _____ _________ ____ ____.
_____ _____ _________ __________ __________ ________ ______ ________ _______ _________ ___ _________.
____ ____ __________ ______ ________ _________ __________.
______ ____ ____ ______ _________ _____ ________ ________ __________ ________.
____ _________ ______ ____ ___.
_______ ________ __________ ___ _____ __________.
______ ____ _______ ___ __________ ________ _____.
________ _________ __________ _________ __________ ________ _______ ________ _____ _____.
________ ____ ________ _________ __________ ______ _________ __________ __________ ___ _____.
_____ ___ _________ _____ ______ ____ ________ _____ ______ _____.
______ __________ _______ ____ _____ ______ ____ ______ __________ ________ _____ ____.
___ ______ _________ _________ ________ ______ _____ __________.
__________ ___ ________ ______ __________ _________ ______ _______ ______.
____ _________ _____ ____ _____ ________ _______ __________ _____.
___ _____ __________ ____ ___ __________ __________ ______.
__________ ____ ________ ________ _______ _______.
____ ___ ______ ___ ________ __________ __________.
_______ ____ ________ _________ __________ _________ ___ _______ _________ ___ ____.
______ __________ _____ ___ ____ _________ ___.
Get Full Answer on WhatsApp
Apply poker test to the following sequence with level of significane α = 0.05. (4) 1001101000010000101111011 01110100101101100100110.
c) Apply runs test to the following sequence
i) Bob uses ElGamal cyrptosystem with parameters p = 47, g = 5 and the secret value x = 3. What values will he make public?
ii) 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?
iii) Explain how Bob will decrypt the message.
b) i) Bob uses ElGamal cyrptosystem with parametersand the secret value x = 3. What values will he make public?
ii) Alice wants to send Bob the messageShe chooses k = 5. How will she compute the cipher text? What information does she send to Bob?
iii) Explain how Bob will decrypt the message
b) A 64 bit key for the DES is given below
i) Check whether the key is error free using the parity bits.
ii) Find the keys for the second round.
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:
Next, we choose an inveritble 2×2 matrix with coefficients in Z26, for example, A = 
This matrix has determinant 
is a unit in Z26 with inverse 
We write each pair of elements in Z26 as a column vector and multiply it by A:
We then convert each pair of numbers to a pair of characters and write them down. In this example, we get the cipher text "LSPFYGXUEN" corresponding to the plain text "ALLWELL".
To decrypt, we convert pairs of characters to pairs of numbers and multiply by
Decrypt the text "TWDXHUJLUENN" which was encrypted using the Hill’s cipher with the matrix 
as the encryption matrix.
a) Decrypt each of the following cipher texts:
i) Text: "CBBGYAEBBFZCFEPXYAEBB", encrypted with affine cipher with key (7,2).
ii) Text:"KSTYZKESLNZUV", encrypted with Vigenère cipher with key "RESULT".
a) Decrypt the ciphertext 101000111001 which was encrypted with the Toy block cipher once using the key 101010010. Show all the steps