A. Universal forgery
B. Total break
C. Selective forgery
D. Existential forgery
Explanation: Total break is finding private key and Universal forgery is finding signing algorithm. Selective forgery is doing forgery of signature for particular message. Atleast one message can have forgery signature.
A. Easy to produce
B. Easy to recognize
C. Easy to verify
D. Computationally feasible
Explanation: If a digital signature is computationally feasible, then it is very easy for a hacker to attack the signing scheme. He may forge the signature for the new message or change the signature for the present message.
A. Source and destination
B. Source and third party
C. Destination and third party
D. Source and destination and third party
Explanation: In general, there will be a third party, who authenticate the digital signatures. But there is no rule that everyone should believe the third party. So, the direct digital signature scheme involves sender and receiver. And receiver knows from where the message is coming using public key of the sender.
A. Signature key is of signing and public key for verification
B. Public key for verification and signature is for authentication
C. Signature key is for verification and public key for signing
D. Both signing and verification is done by public key
Explanation: In digital signature, private key is the signature key, that is used to create digital signature. And this private key belongs to the signer. Public key belongs to the receiver who receives the message. These two keys are used in digital signature algorithm.
A. Time saving
B. Security
C. Time saving and computationally less expensive
D. Secured and less time requires
Explanation: RSA uses expressions with exponential, that is modular exponentiation. So, it is difficult to let the large data be signed using modular exponentiation. Hash value of the message is small compared to the whole message. So, it saves time and computation power to use hash to be signed.
A. Message authentication
B. Data integrity
C. Non-repudiation
D. Security of the message
Explanation: Channel security is not in hands of digital signature, even the secret key is being transmitted between sender and receiver. Security of the message will be depending on the channel that is being used.
A. Ecdsa
B. Dsa
C. Rsa pss
D. Rsa
Explanation: ECDSA stands for elliptic curve digital signature algorithm. ECDSA has huge acceptance, because it uses small key bit length, elliptic curve cryptography and secured.
A. Ecdsa
B. Dsa
C. Rsa ? pss
D. Sha
Explanation: SHA(secured hash function) is the hash algorithm which uses MD4 hash function. ECDSA, DSA and RSA – PSS are the three algorithms in digital signatures. ECDSA stands for elliptic curve digital signature algorithm, RSA – PSS is probabilistic signature scheme. DSA is digital signature algorithm.
A. 1993
B. 1992
C. 1991
D. 1990
Explanation: After RSA public key algorithm, ElGamal was introduced for digital signatures. But it is claimed by the government, that this algorithm is too slow, insecure, new and secret to meet the cyptographic standards.
A. True
B. False
C.
D.
Explanation: Confidentiality function involves receivers public key for encryption, and private key for decryption. The sender cannot deceive the receiver when the digital signature function is inside. Because decryption of the message cannot be done by the sender without receiver’s private key. And the sender cannot change the digital signature.