0% found this document useful (0 votes)
59 views3 pages

Cs8792-Cryptography and Network Security Unit-3: Sn. No. Option 1 Option 2 Option 3 Option 4 Correct Option

The document is a quiz on cryptography and network security concepts. It contains 31 multiple choice questions testing knowledge of topics like Diffie-Hellman key exchange, RSA, Elgamal cryptosystem, Rabin cryptosystem, elliptic curve cryptography, and other cryptographic algorithms and techniques. The questions cover concepts such as man-in-the-middle attacks, asymmetric vs symmetric key cryptography, encryption algorithms, key sizes, elliptic curve equations, and more. The document provides the question, multiple choice answers, and indicates the correct answer choice for each question.

Uploaded by

abrar nahin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
59 views3 pages

Cs8792-Cryptography and Network Security Unit-3: Sn. No. Option 1 Option 2 Option 3 Option 4 Correct Option

The document is a quiz on cryptography and network security concepts. It contains 31 multiple choice questions testing knowledge of topics like Diffie-Hellman key exchange, RSA, Elgamal cryptosystem, Rabin cryptosystem, elliptic curve cryptography, and other cryptographic algorithms and techniques. The questions cover concepts such as man-in-the-middle attacks, asymmetric vs symmetric key cryptography, encryption algorithms, key sizes, elliptic curve equations, and more. The document provides the question, multiple choice answers, and indicates the correct answer choice for each question.

Uploaded by

abrar nahin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

CS8792-CRYPTOGRAPHY AND NETWORK SECURITY

UNIT- 3

Sn. Correct
Question Option 1 Option 2 Option 3 Option 4
No. Option
The man-in-the-middle attack can endanger the security of
1 Authenticated Joined Submit Separate 1
the Diffie-Hellman method if two parties are not
2 RSA is also a stream cipher like Merkel-Hellman TRUE FALSE 1
3 An Asymmetric-Key (or public-key) cipher uses 1 Key 2 Key 3 Key 4 Key 2
Rabin Cryptosystem is a variant of the Elgamal
4 TRUE FALSE 2
Cryptosystem
5 In RSA, Ф(n) = ___ in terms of p and q (p)/(q) (p)(q) (p-1)(q-1) (p+1)(q+1) 3
In Asymmetric Key Cryptography, the two key, e and d,
6 Others Data Keys Each other 4
have a special relationship to
Using Rabin cryptosystem with p=23 and q=7 ,Encrypt
7 42 93 74 12 4
P=24 to find ciphertext. The Cipher text is
For RSA to work, the value of P must be less than the
8 p q n f 3
value of
9 Session keys are transmitted after being encrypted by make-shift keys temporary keys master keys section 3
Which Cryptographic system uses C1 = (e1r) mod p and
10 1
C1 = (e2r x P) mod p at the encryption side? Elgamal RSA Rabin Whirlpool
The certificate message is required for any agreed-on key Ephemeral Diffie- Anonymous Diffie- Fixed Diffie-
11 RSA 2
exchange method except Hellman Hellmanc Hellmand.
Sender chooses p = 107, e1 = 2, d = 67, and the random
12 integer is r=45. Find the plaintext to be transmitted if the 45 76 66 13 3
ciphertext is (28,9)
In Asymmetric key Cryptography, although RSA can be
13 used to encrypt and decrypt actual messages, it is very Short Flat Thin 2
Long
slow if the message is
Which of the following is not a type of symmetric-key Data Encryption
14 Caesar cipher Diffie Hellman cipher Playfair cipher 3
cryptography technique? Standard (DES)
In Elgamal cryptosystem, given the prime p=31,Choose
15 24 36 25 62 3
e1= first primitive root of p and d=10, calculate e2
How many bytes of the secret key is generated using
16 256 871 1024 962 1
Diffie-Hellman encryption/decryption scheme?
Computation of the discrete logarithm is the basis of the Symmetric Asymmetric Diffie-Hellman key Secret key
17 3
cryptographic system ___ cryptography cryptography exchange cryptography

Downloaded from: annauniversityedu.blogspot.com


In Elgamal cryptosystem, given the prime p=31,Encrypt
18 the message “HELLO”; use 00 to 25 for encoding. The 9 7 23 27 1
value of C2 for character ‘O’ is
19 What is the block size of RC6 Feistel block cipher? 5013 bits 128 bits 596 bits 1768 bits 2
y3+b_1 xy+b_2 y3+b_1 x+b_2 y2+b_1 xy+b_2
y2+b_1 xy+b_2
20 What is the general equation for elliptic curve systems y=x33+a_1 x2+a_2 y=x2+a_1 x2+a_2 y=x3+a_1 4
y=x3+a_1 x2+a_2
x+a_3 x+a_3 x2+a_2 x+a_3
Public Publicly available Public-key
21 USENET falls under which category of public key sharing? Public-key authority 1
announcement directory certificates
In Singular elliptic curve, the equation x^3+ax+b=0 does does not have has three distinct
22 has three distinct has three unique 1
____ roots three distinct unique
23 The value of 52003 mod 7 is(use fermat's theorem) 3 4 8 9 1
24 Elliptic curve cryptography follows the associative property TRUE FALSE 1
In Elgamal cryptosystem, given the prime p=31,What is
25 H L O M 1
the respective plaintext character for C = (27, 20)?
How many real and imaginary roots does the equation 2 imaginary, 1
26 2 real, 1 imaginary all real all imaginary 4
y2=x3-1 have real
27 “In ECC, the inverse of point P =(x1, y1) is Q = (-x1, y1). “ TRUE FALSE 2
In the elliptic curve group defined by y2= x3- 17x + 16 over
28 (15, -56) (-23, -43) (69, 26) (12, -86) 1
real numbers, what is P + Q if P = (0,-4) and Q = (1, 0)?
How many real and imaginary roots does the equation 2 imaginary, 1
29 2 real, 1 imaginary all real all imaginary 2
y2=x3-4x have real
In the elliptic curve group defined by y2= x3- 17x + 16 over
30 (12.022, -39.362) (32.022, 42.249) (11.694, -43.723) (43.022, 39.362) 1
real numbers, what is 2P if P = (4, 3.464)
In public key cryptosystem _____ keys are used for None of the
31 Same Different Encryption Keys 2
encryption and decryption. mentioned
Private & Public key None of the
32 PGP system uses Private key system Public key system 3
system mentioned
Public key private & Public key none of the
33 Knapsack problem can be solved by public key system 1
cryptosystem system mentioned
34 Merkle hellman is a symmetric cryptosystem. TRUE FALSE 2
Encryption & None of the
35 In public key cryptosystem which is kept as public? Encryption keys Decryption keys 1
Decryption keys mentioned
36 A cryptographic hash function has variable output length. TRUE FALSE 2
None of the
37 In a trapdoor function, the functions are easy to go in One direction Two directions All directions 1
mentioned
Public key Public & Private key none of the
38 Which algorithm can be used to sign a message? private key algorith 1
algorithm algorithm mentioned
In this Merkle Hellman method same key is used for
39 TRUE FALSE 2
encryption and decryption.

Downloaded from: annauniversityedu.blogspot.com


Each element Each element Each element
Each element is
greater than sum of greater than the lesser than the
40 A set of numbers is called as super increasing if greater than 2
all the previous average of all sum of all the
previous element
elements elements elements

Downloaded from: annauniversityedu.blogspot.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy