Scribd
Upload
76 views2 pages

INTERNAL Assessment Asign1

network security and cryptography question

Uploaded by

Abhishek Kumar Dey
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
76 views2 pages

INTERNAL Assessment Asign1

network security and cryptography question

Uploaded by

Abhishek Kumar Dey
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/ 2

PEC-CS701

1. Describe a single round of DES with block diagram.


2. Discuss how encryption happens in RC5.
3. (a) Why is it important to study the Fiestel Cipher?
(b) Describe the Fiestel Cipher structure in brief. Point out the design features and
parameters on which the exact realization depends. Also discuss the decryption
algorithm executed at the receiving end.
4. Analyse RSA algorithm with the following example. In the public-key system using RSA,
you intercept the cipher text CT=10 sent to a user whose public key is E=5, N=35. What
is the plain text PT?
5. Explain the significance of SHA-1(message digest) algorithm. Point out how SHA- 1 is
differing from MD5 and analyze the key requirements of message digest.
6. Comment critically on the following:-
a) Symmetric key cryptography does not provide authentication and non-repudiation.
b) The digital envelope technique combines the best features of both symmetric and
asymmetric key cryptography.
c) Secret key cryptography is faster than Public key cryptography.
7. Defend why biometric authentication is needed and summarize Kerberos Protocol in brief.
8. Formulate the reasons of using SSO using its two approaches. Construct reasons why SSL
layer is positioned between Application layer and Transport layer.
9. Develop the broad level steps in PEM and PGP.
5 2𝑇
10. Decrypt the cipher text "PQTYJ" using Hill cipher with the inverse key [ ]
1 7
11. The following 64-bit value is chosen as key k: (in HEX)
0 1 2 3 4 5 6 7 8 9 A B C D E F
Find the value of the key K in the first round of DES.
12. Perform encryption and decryption using RSA Algorithm. for the following: P=7; q=11;
e=17; M=8.
13. Perform decryption and encryption using RSA algorithm with p=3, q=11, e=7 and N=5.
14. Let m and n be positive integers. Write out the plaintext, by rows, in mxn rectangles. Then
form the ciphertext by taking the columns of these rectangles. For example, if m = 4 and
n = 3, then we would encrypt the plaintext "cryptography" by forming the following
rectangle:

cryp
togr
aphy

The ciphertext would be CTAROPYGHPRY.

a) Describe how Bob would decrypt a ciphertext, given values for m and n.
b) Decrypt the following ciphertext, which was obtained using the preceding method of
encryption:
Ctxt: MYAMRARUYIQTENCTORAHROYWDSOYEOUARRGDERNOGW
15. Let DES(a,k) represent the encryption of plaintext a with key k using the DES
cryptosystem. Suppose c = DES(a,k) and cc = DES(a',k'), where (') denotes bitwise
complement. Prove that cc = c' (i.e., if we complement the plaintext and the key, then the
ciphertext is also complemented). Note that this can be proved using only the "high-level"
description of DES -- the actual structure of S-boxes and other system components are
irrelevant.
16. Suppose we are told that the plaintext: conversation
yields the ciphertext : HIARRTNUYTUS
where the Hill Cipher is used but the keysize m is not specified. Determine the encryption
matrix.
17. A generalization of the Caesar cipher, known as the affine Caesar cipher, has the following
form:
For each plaintext letter p, substitute the ciphertext letter
C: C = E([a, b], p) = (ap + b) mod 26

A basic requirement of any encryption algorithm is that it be one-to-one. That is, if p ≠ q,


then E(k, p) ≠ E(k, q). Otherwise, decryption is impossible, because more than one
plaintext character maps into the same ciphertext character. The affine Caesar cipher is
not one-to-one for all values of a. For example, for a = 2 and b = 3, then E([a, b], 0) = E([a,
b], 13) = 3.

a. Are there any limitations on the value of b? Explain why or why not.
b. Determine which values of a are not allowed.
c. Provide a general statement of which values of a are and are not allowed. Justify your
statement.
18. The following ciphertext was generated using a simple substitution algorithm:
Write an algorithm to convert it to plain text.

"hzsrnqc klyy wqc flo mflwf ol zqdn nsoznj wskn lj xzsrbjnf, wzsxz gqv zqhhnf ol ozn
glco zlfnco hnlhrn; nsoznj jnrqosdnc lj fnqj kjsnfbc, wzsxz sc xnjoqsfrv gljn efeceqr.
zn rsdnb qrlfn sf zsc zlecn sf cqdsrrn jlw, wzsoznj flfn hnfnojqonb. q csfyrn blgncosx
cekksxnb ol cnjdn zsg. zn pjnqmkqconb qfb bsfnb qo ozn xrep, qo zlejc
gqozngqosxqrrv ksanb, sf ozn cqgn jllg, qo ozn cqgn oqprn, fndnj oqmsfy zsc gnqrc
wsoz loznj gngpnjc, gexz rncc pjsfysfy q yenco wsoz zsg; qfb wnfo zlgn qo naqxorv
gsbfsyzo, lfrv ol jnosjn qo lfxn ol pnb. zn fndnj ecnb ozn xlcv xzqgpnjc wzsxz ozn
jnkljg hjldsbnc klj soc kqdlejnb gngpnjc. zn hqccnb onf zlejc leo lk ozn ownfov-klej sf
cqdsrrn jlw, nsoznj sf crnnhsfy lj gqmsfy zsc olsrno."
19. This problem explores the use of a one-time pad version of the Vigenère cipher. In this
scheme, the key is a stream of random numbers between 0 and 26.
For example, if the key is 3 19 5 . . . , then the first letter of plaintext is encrypted with a
shift of 3 letters, the second with a shift of 19 letters, the third with a shift of 5 letters,
and so on.
a. Encrypt the plaintext sendmoremoney with the key stream 3 11 5 7 17 21 0 11 14 8 7 13 9
b. Using the ciphertext produced in part (a), find a key so that the ciphertext decrypts to the
plaintext cashnotneeded.
20. Consider a block encryption algorithm that encrypts blocks of length n, and let N = 2n. Say
we have t plaintext–ciphertext pairs Pi, Ci = E(K, Pi), where we assume that the key K
selects one of the N! possible mappings.
Imagine that we wish to find K by exhaustive search. We could generate key K′ and test
whether Ci = E(K′, Pi) for 1 … i … t.
If K′ encrypts each Pi to its proper Ci, then we have evidence that K = K′. However, it may
be the case that the mappings E(K, # ) and E(K′, # ) exactly agree on the t plaintext–cipher
text pairs Pi, Ci and agree on no other pairs.

a. What is the probability that E(K, # ) and E(K′, # ) are in fact distinct mappings?
b. What is the probability that E(K, # ) and E(K′, # ) agree on another t′ plain text cipher text
pairs where 0 … t′ … N- t?

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