Exam 10: Other Public-Key Cryptosystems
Exam 1: Overview45 Questions
Exam 2: Classical Encryption Techniques45 Questions
Exam 3: Block Ciphers and the Data Encryption Standard27 Questions
Exam 4: Basic Concepts in Number Theory and Finite Fields26 Questions
Exam 5: Advanced Encryption Standard45 Questions
Exam 6: Block Cipher Operation44 Questions
Exam 7: Random and Pseudorandom Number45 Questions
Exam 8: More Number Theory45 Questions
Exam 9: Public-Key Cryptography and Rsa45 Questions
Exam 10: Other Public-Key Cryptosystems45 Questions
Exam 11: Cryptographic Hash Functions45 Questions
Exam 12: Message Authentication Codes45 Questions
Exam 13: Digital Signatures45 Questions
Exam 14: Key Management and Distribution45 Questions
Exam 15: User Authentication Protocols45 Questions
Exam 16: Network Access Control and Cloud Security45 Questions
Exam 17: Transport-Level Security26 Questions
Exam 18: Wireless Network Security45 Questions
Exam 19: Electronic Mail Security45 Questions
Exam 20: Ip Security44 Questions
Select questions type
The Diffie-Hellman key exchange formula for calculation of a secret key by User A is:
(Multiple Choice)
4.9/5
(31)
The Diffie-Hellman key exchange is a simple public-key algorithm.
(True/False)
4.9/5
(31)
A considerably larger key size can be used for ECC compared to RSA.
(True/False)
4.9/5
(34)
The addition operation in elliptic curve cryptography is the counterpart of modular multiplication in RSA,and multiple addition is the counterpart of __________ .
(Essay)
4.9/5
(50)
The principal attraction of __________,compared to RSA,is that it appears to offer equal security for a far smaller key size,thereby reducing processing overhead.
(Essay)
4.8/5
(35)
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.
(Multiple Choice)
4.8/5
(29)
The key exchange protocol is vulnerable to a __________ attack because it does not authenticate the participants.
(Multiple Choice)
4.8/5
(38)
The security of ElGamal is based on the difficulty of computing discrete logarithms.
(True/False)
4.8/5
(36)
Most of the products and standards that use public-key cryptography for encryption and digital signatures use RSA.
(True/False)
4.7/5
(42)
Included in the definition of an elliptic curve is a single element denoted O and called the point at infinity or the __________ .
(Multiple Choice)
4.9/5
(40)
Eqa,b)is an elliptic curve with parameters a,b,and q,where _________ is a prime or an integer of the form 2m.
(Essay)
4.9/5
(38)
The Diffie-Hellman algorithm depends on the difficulty of computing discrete logarithms for its effectiveness.
(True/False)
4.8/5
(41)
Two families of elliptic curves are used in cryptographic applications: prime curves over Zp and __________ over GF2m).
(Essay)
4.9/5
(31)
A number of public-key ciphers are based on the use of an abelian group.
(True/False)
4.9/5
(29)
For a ___________ defined over GF2m),the variables and coefficients all take on values in GF2m)and in calculations are performed over GF2m).
(Multiple Choice)
5.0/5
(32)
____________ makes use of elliptic curves in which the variables and coefficients are all restricted to elements of a finite field.
(Multiple Choice)
5.0/5
(35)
__________ can be used to develop a variety of elliptic curve cryptography schemes.
(Multiple Choice)
4.7/5
(27)
If a secret key is to be used as a _________ for conventional encryption a single number must be generated.
(Multiple Choice)
4.9/5
(42)
Showing 21 - 40 of 45
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)