Exam 10: Other Public-Key Cryptosystems

to form a cryptographic system using __________ we need to find a "hard-problem" corresponding to factoring the product of two primes or taking the discrete logarithm.

(Short Answer)

4.8/5

(29)

Question 21

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

(True/False)

4.9/5

(33)

Question 22

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.

(Short Answer)

4.8/5

(33)

Question 23

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

(True/False)

4.9/5

(38)

Question 24

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.

(Short Answer)

4.8/5

(37)

Question 25

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

(Short Answer)

4.9/5

(30)

Question 26

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

(True/False)

4.9/5

(37)

Question 27

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

(Short Answer)

4.8/5

(31)

Question 28

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.

(True/False)

4.9/5

(43)

Question 29

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

(Multiple Choice)

4.8/5

(40)

Question 30

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

(Multiple Choice)

4.9/5

(40)

Question 31

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

(Short Answer)

4.9/5

(30)

Question 32

An encryption/decryption system requires a point G and an elliptic group _________ as parameters.

(Multiple Choice)

4.8/5

(35)

Question 33

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

(True/False)

4.8/5

(26)

Question 34

__________ are best for software applications.

(Multiple Choice)

4.9/5

(33)

Question 35

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

(True/False)

4.9/5

(30)

Question 36

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

(True/False)

4.8/5

(31)

Question 37

For a ___________ defined over GF(2m), the variables and coefficients all take on values in GF(2m) and in calculations are performed over GF(2m).

(Multiple Choice)

4.9/5

(31)

Question 38

A(n) ___________ G is a set of elements with a binary operation, denoted by , that associates to each ordered pair (a,b) of elements in G an element ( ab) in G.

(Short Answer)

4.9/5

(36)

Question 39

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.7/5

(35)

Question 40

Showing 21 - 40 of 45

to form a cryptographic system using __________ we need to find a "hard-problem" corresponding to factoring the product of two primes or taking the discrete logarithm.

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

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.

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

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.

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

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

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

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 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.

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

An encryption/decryption system requires a point G and an elliptic group _________ as parameters.

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

__________ are best for software applications.

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

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

For a ___________ defined over GF(2m), the variables and coefficients all take on values in GF(2m) and in calculations are performed over GF(2m).

A(n) ___________ G is a set of elements with a binary operation, denoted by , that associates to each ordered pair (a,b) of elements in G an element ( ab) in G.

Included in the definition of an elliptic curve is a single element denoted O and called the point at infinity or the __________ .

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

to form a cryptographic system using __________ we need to find a "hard-problem" corresponding to factoring the product of two primes or taking the discrete logarithm.

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

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.

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

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.

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

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

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

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 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.

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

An encryption/decryption system requires a point G and an elliptic group _________ as parameters.

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

__________ are best for software applications.

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

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

For a ___________ defined over GF(2m), the variables and coefficients all take on values in GF(2m) and in calculations are performed over GF(2m).

A(n) ___________ G is a set of elements with a binary operation, denoted by *, that associates to each ordered pair (a,b) of elements in G an element ( a*b) in G.

Included in the definition of an elliptic curve is a single element denoted O and called the point at infinity or the __________ .

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

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

A(n) ___________ G is a set of elements with a binary operation, denoted by , that associates to each ordered pair (a,b) of elements in G an element ( ab) in G.