IAS QUIZ 10

IAS QUIZ 10

University

25 Qs

quiz-placeholder

Similar activities

Programming Concepts in C

Programming Concepts in C

University

20 Qs

CLP E4 - Prova 01

CLP E4 - Prova 01

University

20 Qs

Final - Introduction to Cryptography & Quantum Computing

Final - Introduction to Cryptography & Quantum Computing

University

20 Qs

DSA_Quiz_3

DSA_Quiz_3

University

20 Qs

Counting Principle

Counting Principle

University

23 Qs

1 Binary Search Trees

1 Binary Search Trees

University

20 Qs

Quadratic up to Modeling

Quadratic up to Modeling

10th Grade - University

25 Qs

Dasar DKV Genap

Dasar DKV Genap

10th Grade - University

30 Qs

IAS QUIZ 10

IAS QUIZ 10

Assessment

Quiz

Computers

University

Easy

Created by

Darwin Vargas

Used 1+ times

FREE Resource

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The Diffie-Hellman key exchange is a simple public-key

algorithm.

T

F

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The security of ElGamal is based on the difficulty of

computing discrete logarithms.

T

F

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Most of the products and standards that use public-key

cryptography for encryption and digital signatures use RSA.

T

F

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

ECC is fundamentally easier to explain than either RSA or

Diffie-Hellman.

F

T

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Elliptic curves are ellipses.

F

T

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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.

T

F

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

T

F

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?