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 1011 1101 1011 0111 0100 1011 0110 0100 110 ``` ____ _______ ____ ____ ______ ________.
___ ________ ___ ___ ______ ______ __________ ____ _________.
________ __________ ____ __________ ____ ______ ____ __________ ________ ______ ______ _______.
___ _____ __________ ______ ________.
___ ________ _____ ____ _________ ___.
_______ _____ __________ _______ _______ __________ _______ _________ ________ _______ ____.
__________ ________ __________ ___ _____.
____ ____ __________ ____ ___.
_____ _______ ____ ________ _____ ________ _________ _______ ______ ___ __________.
_______ ________ ___ ________ _________.
_______ ___ _________ __________ ____ ______ ___ ________ _______ _______.
_______ ________ ________ ________ ______ _____ ___ __________ ____ ________.
_____ ___ __________ ____ _______ ________ __________ ______ ________ ____ __________ ____.
____ _________ _____ _________ ________ _______ ________ ________ ______.
____ ___ ____ ____ ____ ______ _________ ___ ____.
_______ _________ _________ _____ ___ _____.
_____ _________ ___ _________ ______ _________ _________ ________ __________ _____.
_______ ______ ______ _______ __________ ___ ___ _________ _____ ____ _________ _________.
________ _____ __________ ____ _________ _______ _________ __________ ________ _______ _______.
__________ ___ _________ _____ ______ _____ _____ _______.
____ ________ _________ ______ ____ ________ ___.
_________ _____ _____ ______ _______ __________ _______ __________ _________ ______.
_______ _____ _____ __________ ______ ____ _______ __________ ______ _________ _____.
_______ ____ __________ _________ ____ _______ ________ ____ ______ _______ ______.
______ _____ __________ ___ ______.
_____ ________ ______ ___ ________ ___ _________ __________ _________.
______ ___ ______ _______ ______ __________ __________.
Get Full Answer on WhatsApp
Decrypt the message c = 23 that was encrypted using RSA algorithm with e = 43 and n = 77.
Apply poker test to the following sequence with level of significane α = 0.05. (4) 1001101000010000101111011 01110100101101100100110.
a) Considering the bytes 10001001 and 10101010 as elements of the g(X)) is the polynomia
find their product and quotient.
a) Find the product of
using the algorithm in page 23, block 1. You should show all the steps as in example 11, pag 22, block 1.
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
c) 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?
b) Another version of the columnar transposition cipher is the cipher using a key word. In this cipher, we encrypt as follows: Given a key word, we remove all the duplicate characters in the key word. For example, if the key word is 'SECRET", we remove the second 'E' and use 'SECRT" as the key word. To encrypt, we form a table as follows: In the first row, we write down the key word. In the following rows, we write the plaintext. Suppose we want to encrypt the text 'ATTACKATDAWN'. We make a table as follows:
| S | E | C | R | T |
| A | T | T | A | C |
| K | A | T | D | A |
| W | N | X | X | X |