Apply the frequency test, serial test and autocorrelation test to the following sequence at level of significance :
011001110000110010011100.
The given binary sequence has length (n=24). The number of 1s in the sequence is 11 and the number of 0s is 13. For the frequency (monobit) test, the test statistic is _________ ______ ___ ____ __________ __________ _________.
___ _________ _____ _______ ___ __________ ___ _________ _________ _________ _________.
________ _________ ________ ______ __________ ____ _____ _____.
___ ______ _____ ____ ___ ___ ______ ________ ____ _____ __________ ______.
_________ ______ _______ _____ ___ ____ ____ ________.
__________ _______ _______ ______ ______ __________ ___ __________ _______ ____.
_______ _____ ____ ____ ___ _________ _______ _____.
________ _____ _____ ______ ________ _____ ______.
___ ________ ________ _______ __________ ___ _________ _______ ________ _______ __________.
____ _________ ______ _____ _________ _________ __________ __________ _____.
___ ___ ______ _________ ____ __________ __________ _______.
_________ ________ ____ __________ _________ _____ ______ ________.
________ ____ _______ ______ ________.
____ ______ _____ ______ ___ ___ ____.
_________ __________ _______ _______ ________.
_________ ______ ______ ______ __________ _______ _______.
____ _______ __________ __________ ______ ______ _____ _____ ________.
___ ____ __________ _____ _____ ____ _______ _____ ______ ____ ____ _____.
___ ________ _________ _______ ______ ____ ___ _________ ________.
_____ _______ _____.
Get Full Answer on WhatsApp
Apply the frequency test, serial test and autocorrelation test to the following sequence at level of significance :
011001110000110010011100.
Decrypt the ciphertext 101000111001 which was encrypted with the Toy block cipher once using the key 101010010. Show all the steps.
b) A 64 bit key for the DES is given below 11000111
10000101
11110111
11000001
11111011
10101011
10011101
10010001
i) Check whether the key is error free using the parity bits.
Let . Find the product of x2 + 2x + 1 + (f(x)) and x2 + 3x - 1 + (f(x)) using the algorithm in page 23, block 1. You should show all the steps as in example 11, page 22, block 1.
Explain how Bob will decrypt the message.
9) a) Solve the discrete logarithm problem using Baby-Step, Giant-Step algorithm.
Alice wants to use the ElGamal digital signature scheme with public parameters ,
, secret value
and
. She wants to sign the message
and send it to Bob. She chooses
as the secret value. Explain the procedure that Alice will use for computing the signature of the message. What information will she send Bob?
Find a recurrence that generates the sequence 110110110110110.
Decrypt the message that was encrypted using RSA algorithm with
and
.