Exam 10: Other Public-Key Cryptosystems

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

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

The PRNG variable ___________ is defined in NIST SP 800-90 as a number associated with the amount of work required to break a cryptographic algorithm or system.

We use a cubic equation in which the variables and coefficients all take on values in the set of integers from 0 through p - 1 and in which calculations are performed modulo p for a __________ over Zp.

Elliptic curve arithmetic can be used to develop a variety of elliptic curve cryptography schemes,including key exchange,encryption,and ___________ .

For cryptography the variables and coefficients are restricted to elements in a __________ field.

If three points on an elliptic curve lie on a straight line their sum is __________ .

The form of cubic equation appropriate for cryptographic applications for elliptic curves is somewhat different for GF2m)than for Zp.

A __________ GF2m)consists of 2m elements together with addition and multiplication operations that can be defined over polynomials.

The fastest known technique for taking the elliptic curve logarithm is known as the _________ method.

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

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

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

The __________ pseudorandom number generator is recommended in the ANSI standard X9.82 Random Number Generation)and in the ISO standard 18031 Random Bit Generation).

The purpose of the ___________ algorithm is to enable two users to securely exchange a key that can then be used for subsequent encryption of messages.

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.

Asymmetric algorithms are typically much slower than symmetric algorithms so they are not used to generate open-ended __________ generator bit streams.

An)__________ is defined by an equation in two variables with coefficients.

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

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