i) Prepare logarithm and antilogarithm tables as given in page 23 of block 1
The logarithm and antilogarithm tables are essential tools used in cryptography, especially in encryption algorithms that involve mathematical operations like modular exponentiation. While it is impractical to manually create large logarithm and antilogarithm tables _______ _____ ___ __________ _______ _______ _______ _________ _______.
_____ __________ _______ __________ __________ _________ _______.
____ _____ __________ _____ __________ _________ ___ __________ ___ __________.
__________ ________ _________ _________ _____ ______ ______ ______ ___ __________.
___ _________ ________ _____ ________ _______ _______ ______.
_________ ____ ________ _______ ___ _________ ____.
__________ _________ ______ ______ _______ ________ _________ _____.
_______ _________ ____ _______ _________ _________ ___ _____ _______ ____.
_____ ______ __________ ____ _______ _________ _________ __________ _____ __________.
____ __________ ________ ____ _______ ___ ____ ______ ___ __________.
_________ ______ _____ __________ ______ ________ _______ ___ ________ __________.
________ _______ ___ ________ _____ _________ ______ _______.
___ _____ ____ ______ __________ _____ __________.
___ _____ _____ _________ ____ _____ ___ _____ ___.
___ _________ _________ _________ _____ ___ ____ ____.
___ _______ ____ ____ _______ __________ _____ _____ ___.
________ _____ ___ _____ _________ _________ __________ ___ _________.
_______ ___ ______ _______ _______ ____ ____ ________.
________ ______ ________ ________ __________ _________ ______ ____ ________ _____ ______.
_________ ____ ________ ____.
Get Full Answer on WhatsApp
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 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.
ii) Find the keys for the second round
Find a recurrence that generates the sequence 110110110110110.
Let f (x) = x3 − x − 1 ∈ Z5[x]. 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.
Apply poker test to the following sequence with level of significane α = 0.05. (4) 1001101000010000101111011 01110100101101100100110.
c) Apply runs test to the following sequence
Solve the discrete logarithm problem 5x ≡ 22 (mod 47) using Baby-Step, Giant-Step algorithm.
b) Alice wants to use the ElGamal digital signature scheme with public parameters 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