Which of following statements are true

$$ Semantics of signed messages do not have any importance for countering attacks on the RSA digital signature protocol.

$$ In Elgamal cryptosystem the public key of the receiving side stays fixed, while the public ephemeral key of the sending side must be different for every encrypted plaintext.

$$ There are significantly more classical asymmetric cryptographic algorithms than symmetric cryptographic algorithms.

$$ Hash functions cannot be used in message authentication codes.

Which of these statements are true

$$ The RSA can be considered as a probabilistic encryption scheme, contrary to the Elgamal scheme.

$$ The cardinality of the group is also called the order of the group.

$$ Cryptographic checksums are also referred to as MACs.

$$ The public key in Diffie$-$Hellman protocol is computed between both sides of communication in the same way $($as the public parameter alpha to the power of the private key modulo public parameter p $-$ a large prime$).$

Which of the statements presented below are correct

$$ Diffie$-$Hellman key exchange protocol can be easily broken when used with $128$ bits keys with the index$-$calculus attack.

$$ It is proven that the Diffie$-$Hellman problem is equivalent to the discrete logarithm problem.

$$ A group is finite if it has a finite number of elements.

$$ All elliptic curve cryptographic protocols rely on the hardness of the ECDLP.

Which of the below statements on cryptography are correct

$$ For properly chosen secure elliptic curves the best known attacks computing the elliptic curve discrete logarithm problem require circa square root of the public prime parameter steps.

$$ The Existential Forgery Attack can be used only against the Elgamal digital signature protocol.

$$ In a basic digital signature scheme Alice would use her public key to sign the message.

$$ SHA$-1$ hash function has $160$ rounds.

Which statements are correct

$$ Dirichlet's drawer principle or the pigeonhole principle relate to elliptic curve cryptography.

$$ Diffie$-$Hellman protocol is an example of the key transport scheme.

$$ Cryptographic certificates do not require a trusted Certifying Authority.

$$ In asymmetric cryptosystems the communication parties' public keys should be authenticated to provide security against the man$-$in$-$the$-$middle attack, and certificates allow for that.

Which of the statements below on cryptography are correct

$$ RSA cryptosystem can be used for key exchange.

$$ In elliptic curves cryptography the group consists of points on a curve.

$$ Quantum key distribution is a key transport protocol rather than key agreement protocol.

$$ Combining One$-$Time Pad protocol with Diffie$-$Hellman protocol makes sense but offers only conditional security for the OTP.

Which of the following statements on cryptography are true

$$ The reason for using longer keys than currently still secure lengths in asymmetric cryptosystems is to retain longer$-$term security of the encryption or authentication with increasing computing power.

$$ The attack which would require $2$ to the power $40$ steps is beyond rational computational time to be mounted on current computational power available.

$$ The number of shared key pairs for a symmetric cryptography connecting all users in an organization of $750$ users would be over $500$ thousand.

$$ Elliptic curve cryptography cannot be used to exchange keys that could be later employed in e$.$g$.$ symmetric$-$key cryptography $($e$.$g$.$ AES$).$

Which of statements below are correct

$$ In a key agreement protocol one of the parties chooses the key.

$$ Cryptographic certificates for authentication are based on MACs rather than on digital signatures.

$$ Discrete log based protocol can be used to solve the key distribution problem with conditional security.

$$ Hash function in which a very small tempering of the message results in a very small change of the output can be considered secure$.$