Cryptography and Network Security

the key exchange protocol is vulnerable to a __________ attack because it does not authenticate the participants.

the __________ cryptosystem is used in some form in a number of standards including DSS and S/MIME.

For determining the security of various elliptic curve ciphers it is of some interest to know the number of points in a finite abelian group defined over an elliptic curve.

the Diffie-Hellman key exchange is a simple public-key algorithm.

the security of ElGamal is based on the difficulty of computing discrete logarithms.

A considerably larger key size can be used for ECC compared to RS A.

ECC is fundamentally easier to explain than either RSA or Diffie-Hellman.

For purposes of ECC, elliptic curve arithmetic involves the use of an elliptic curve equation defined over an infinite field.

the ____________ protocol enables two users to establish a secret key using a public-key scheme based on discrete logarithms.

there is not a computational advantage to using ECC with a shorter key length than a comparably secure tS A.

Most of the products and standards that use public-key cryptography for encryption and digital signatures use RS A.

the Diffie-Hellman algorithm depends on the difficulty of computing discrete logarithms for its effectiveness.

An encryption/decryption system requires that point P_m be encrypted as a plaintext.

A number of public-key ciphers are based on the use of an abelian group.

the security of ECC depends on how difficult it is to determine k given kP and P.

A(n) __________ is defined by an equation in two variables with coefficients.

Elliptic curves are ellipses.

__________ can be used to develop a variety of elliptic curve cryptography schemes.

Since a symmetric block cipher produces an apparently random output it can serve as the basis of a pseudorandom number generator.

the form of cubic equation appropriate for cryptographic applications for elliptic curves is somewhat different for GF(2^m) than for Z_p.