Question 1

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

Accepted Answer

A) True 
 B)False  True

Question 2

the addition operation in elliptic curve cryptography is the counterpart of modular multiplication in RSA, and multiple addition is the counterpart of __________ .

Accepted Answer

modular exponentiation

Question 3

the __________ key exchange involves multiplying pairs of nonzero integers modulo a prime number q.Keys are generated by exponentiation over the group with exponentiation defined as repeated multiplication.

Accepted Answer

A) Diffie-Hellman 
B) Rabin-Miller 
C) Micali-Schnorr 
D) ElGamal 
A) Diffie-Hellman 
B) Rabin-Miller 
C) Micali-Schnorr 
D) ElGamal A

Question 4

two families of elliptic curves are used in cryptographic applications: prime curves over Zp and __________ over GF(2m).

Accepted Answer

The answer of two families of elliptic curves are used...

Question 5

____________ makes use of elliptic curves in which the variables and coefficients are all restricted to elements of a finite field.

Accepted Answer

A) Prime curve 
B) Elliptic curve cryptography (EC
C)  
C) abelian group 
D) Micali-Schnorr 
A) Prime curve 
B) Elliptic curve cryptography (EC
C)  
C) abelian group 
D) Micali-Schnorr

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

If a secret key is to be used as a _________ for conventional encryption a single number must be generated.

Accepted Answer

A) discrete logarithm 
B) prime curve 
C) session key 
D) primitive root 
A) discrete logarithm 
B) prime curve 
C) session key 
D) primitive root

Question 8

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

Accepted Answer

A) Elliptic curve arithmetic 
B) Binary curve 
C) Prime curve 
D) Cubic equation 
A) Elliptic curve arithmetic 
B) Binary curve 
C) Prime curve 
D) Cubic equation

Question 9

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

Accepted Answer

The answer of A __________ GF(2m) consists of 2m elements...

Question 10

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

Accepted Answer

A) primitive 
B) infinite 
C) public 
D) finite 
A) primitive 
B) infinite 
C) public 
D) finite

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

the key exchange protocol vulnerability can be overcome with the use of digital signatures and __________ certificates.

Accepted Answer

The answer of the key exchange protocol vulnerability can be...

Question 13

Eq(a,b) is an elliptic curve with parameters a, b, and q, where
_________ is a prime or an integer of the form 2m.

Accepted Answer

Question 14

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

Accepted Answer

A) abelian group 
B) binary curve 
C) cubic equation 
D) elliptic curve 
A) abelian group 
B) binary curve 
C) cubic equation 
D) elliptic curve

Question 15

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

Accepted Answer

The answer of the fastest known technique for taking the...

Question 16

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

Accepted Answer

A) Micali-Schnorr 
B) Elgamal-Fraiser 
C) Diffie-Hellman 
D) Miller-Rabin 
A) Micali-Schnorr 
B) Elgamal-Fraiser 
C) Diffie-Hellman 
D) Miller-Rabin

Question 17

the Diffie-Hellman key exchange formula for calculation of a secret key by User A is:

Accepted Answer

A) K = nB x PA 
B) K = nA x PB 
C) K = nP x BA 
D) K = nA x PA 
A) K = nB x PA 
B) K = nA x PB 
C) K = nP x BA 
D) K = nA x PA

Question 18

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

Accepted Answer

A) 0 
B) 1 
C) 6 
D) 3 
A) 0 
B) 1 
C) 6 
D) 3

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

Elliptic curves are ellipses.

Accepted Answer

A) True 
 B)False

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

the addition operation in elliptic curve cryptography is the counterpart of modular multiplication in RSA, and multiple addition is the counterpart of __________ .

the __________ key exchange involves multiplying pairs of nonzero integers modulo a prime number q.Keys are generated by exponentiation over the group with exponentiation defined as repeated multiplication.

two families of elliptic curves are used in cryptographic applications: prime curves over Zp and __________ over GF(2m).

____________ makes use of elliptic curves in which the variables and coefficients are all restricted to elements of a finite field.

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

If a secret key is to be used as a _________ for conventional encryption a single number must be generated.

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

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

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

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

the key exchange protocol vulnerability can be overcome with the use of digital signatures and __________ certificates.

Eq(a,b) is an elliptic curve with parameters a, b, and q, where _________ is a prime or an integer of the form 2^m.

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

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

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

the Diffie-Hellman key exchange formula for calculation of a secret key by User A is:

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

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

Elliptic curves are ellipses.

Computer and Network Security Concepts

Introduction to Number Theory

Classical Encryption Techniques

Advanced Encryption Standard

Block Cipher Operation

Random Bit Generation and Stream Ciphers

Public-Key Cryptography and Rsa

Cryptographic Hash Functions

Message Authentication Codes

Digital Signatures

Lightweight Cryptography and Post-Quantum Cryptography

Cryptographic Key Management and Distribution

User Authentication

Wireless Network Security

Electronic Mail Security

Ip Security

Network Endpoint Security

Cloud Security

Internet of Things Iot Security

Filters

Exam 10: Other Public-Key Cryptosystems

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

the addition operation in elliptic curve cryptography is the counterpart of modular multiplication in RSA, and multiple addition is the counterpart of __________ .

the __________ key exchange involves multiplying pairs of nonzero integers modulo a prime number q.Keys are generated by exponentiation over the group with exponentiation defined as repeated multiplication.

two families of elliptic curves are used in cryptographic applications: prime curves over Zp and __________ over GF(2m).

____________ makes use of elliptic curves in which the variables and coefficients are all restricted to elements of a finite field.

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

If a secret key is to be used as a _________ for conventional encryption a single number must be generated.

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

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

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

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

the key exchange protocol vulnerability can be overcome with the use of digital signatures and __________ certificates.

Eq(a,b) is an elliptic curve with parameters a, b, and q, where _________ is a prime or an integer of the form 2m.

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

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

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

the Diffie-Hellman key exchange formula for calculation of a secret key by User A is:

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

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

Elliptic curves are ellipses.

Computer and Network Security Concepts

Introduction to Number Theory

Classical Encryption Techniques

Advanced Encryption Standard

Block Cipher Operation

Random Bit Generation and Stream Ciphers

Public-Key Cryptography and Rsa

Cryptographic Hash Functions

Message Authentication Codes

Digital Signatures

Lightweight Cryptography and Post-Quantum Cryptography

Cryptographic Key Management and Distribution

User Authentication

Wireless Network Security

Electronic Mail Security

Ip Security

Network Endpoint Security

Cloud Security

Internet of Things Iot Security

Filters

Eq(a,b) is an elliptic curve with parameters a, b, and q, where _________ is a prime or an integer of the form 2^m.