Exam 13: Digital Signatures

the DSS approach makes use of a hash function.

the global public key components of DSA are the same as for the Schnorr signature scheme.

the __________ scheme minimizes the message dependent amount of computation required to generate a signature.

the __________ scheme minimizes the message dependent amount of computation required to generate a signature.

Administrative controls relating to the security of private keys can be employed by including a ____________ (which includes date and time) and to require prompt reporting of compromised keys to a central authority.

the Schnorr signature scheme is based on discrete logarithms.

the attacker finds an efficient signing algorithm that provides an equivalent way of constructing signatures on arbitrary messages is a ___________ .

In the __________ approach only the sender knows the private key so only the sender could have produced a valid signature.

the term __________ refers to a digital signature scheme that involves only the communicating parties.

It must be relatively difficult to recognize and verify the digital signature.

the _________________, which is the latest of the RSA schemes, is the one that RSA Laboratories recommends as the most secure of the RSA schemes.

the first stage in generating an RSA-PSS signature of a message M is to generate from M a fixed-length message digest, called an ______________.

Message authentication protects two parties who exchange messages from any third party, however, it does not protect the two parties against each other.

the digital signature function does not include the authentication function.

the message dependent part of the Schnorr digital signature generation requires multiplying a __________ with an n-bit integer.

to create a __________ a user calculates two quantities, r and s, that are functions of the public key components (p, q, g), the user's private key (x), the hash code of the message H(M), and an additional integer k that should be generated randomly or pseudorandomly and be unique for each signing.

Similar to the generic attack, except that the list of messages to be signed is chosen after the attacker knows the user's public key but before any signatures are seen, is the __________ attack.

As with ElGamal encryption, the global elements of __________ are a prime number q and a, which is a primitive root of q.

the main work for signature generation depends on the message and is done during the idle time of the processor.

the __________ is formed by taking the hash of the message and encrypting the message with the creator's private key.