Cryptography Unit1

Cryptography Unit1

University

25 Qs

quiz-placeholder

Similar activities

Machine Learning and Linear Algebra Quiz

Machine Learning and Linear Algebra Quiz

University

20 Qs

Examen HTML Básico

Examen HTML Básico

University

22 Qs

TEMEL ELEKTRONİK

TEMEL ELEKTRONİK

University

25 Qs

ByteBattle 2.0

ByteBattle 2.0

University

30 Qs

SEMANA 3 VECTORES

SEMANA 3 VECTORES

University

30 Qs

KG12303-CHAPTER 1

KG12303-CHAPTER 1

University

30 Qs

Understanding DBMS Keys and Constraints

Understanding DBMS Keys and Constraints

University

20 Qs

QUIZ - KONSENTRASI TEGANGAN

QUIZ - KONSENTRASI TEGANGAN

University

20 Qs

Cryptography Unit1

Cryptography Unit1

Assessment

Quiz

Engineering

University

Hard

Created by

Jerin Jacob

Used 1+ times

FREE Resource

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

What is the main goal of modern cryptography?

To ensure that all data is publicly accessible.
To eliminate all forms of data encryption.
To ensure confidentiality, integrity, and authenticity of information.
To create unbreakable codes for secret messages.

2.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

Which encryption method uses a public and private key?

Asymmetric encryption
Symmetric encryption
Base64 encoding
Hashing

3.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

Which algorithm is a popular asymmetric encryption method?

DES
RSA
AES
Blowfish

4.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

RSA encryption relies on which mathematical problem?

Discrete logarithm problem
Elliptic curve problem
Integer factorization problem
Prime number generation problem

5.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is the GCD of 48 and 18?

6
36
24
12

6.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What does Euler’s Theorem state?

If n is a positive integer, then a^n ≡ 0 (mod n).
If n is a positive integer and a is coprime to n, then a^φ(n) ≡ 1 (mod n).
If a is any integer, then a^φ(n) ≡ n (mod n).
If n is a prime number, then a^n ≡ a (mod n).

7.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is the modular inverse of 3 modulo 7?

6
2
5
4

Create a free account and access millions of resources

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?