I've uploaded lecture pdf files and questions.read the questions and answer them correctly.when you give me the files especially document files do not convert to pdf. give me docx file

1
    Alice basically choose the secret number for her private key, after that she can computes the quantity A ≡ g a (mod p). To Diffie–Hellman can be used for the exchanging the key. Alice can publish the public key A and she can keep the private key for the secret. So we can assume the Bob’s message m is an integer between the 2 and the p. So we can encrypt the m, Bob can be first randomly choosing the different number k modulo p. Bob can uses the k to encrypting the on message and it can discard it afterword’s. SO the number of k is called the ephemeral key so that can exist the purpose of the encrypting the single message. So now the Bob takes the plaintext for the message m and he can choose he random ephemeral key k.
Eve basically knows that the public parameters can be uses the p and g, and it can give the value of A ≡ g a (mod p), so the Alice’s public key can be give the public knowledge. If the eve can solve the discrete logarithm problem so she can find the plaintext, that can give the small numbers of it.
Example:
In the ElGamal cryptosystem the plain text is basically used an integer m in between the 2 and the p-1, where the cipher text can be used the 2 integers that can be same range gives and these are c1 and c2. So it will take the 2 bits to write the cipher text into the plaintext. So we can say the ElGamal can have the 2 to 1 message encryption. The ElGamal system can give the eve to attack the Diffie–Hellman problem. The encrypting messages can have the back door that can make the decrypt the messages that can solve the Diffie–Hellman problem.
    2
    
    3
    · The commitment scheme is the protocol for the sender and the receiver that can allows the sender and the...