Scribd
Upload
652 views

Assignment-1: Marks (Weightage) : 20 (8%) Submission Due Date

This document outlines an assignment for an Introduction to Cryptography course. It provides 18 problems related to various cryptographic techniques for students to attempt. Students are instructed to attempt any 15 problems and show their work and solutions. Completing all problems will earn extra credit. The assignment is worth 20 marks and is due on April 15, 2021.

Uploaded by

Sriharshitha Deepala
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
652 views

Assignment-1: Marks (Weightage) : 20 (8%) Submission Due Date

This document outlines an assignment for an Introduction to Cryptography course. It provides 18 problems related to various cryptographic techniques for students to attempt. Students are instructed to attempt any 15 problems and show their work and solutions. Completing all problems will earn extra credit. The assignment is worth 20 marks and is due on April 15, 2021.

Uploaded by

Sriharshitha Deepala
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

School: SCOPE Semester: Winter 2020-21

Subject: Introduction to Cryptography Subject Code: CSE1007


ASSIGNMENT-1
Marks (Weightage): 20 (8%) Submission Due Date: 15-April-2021

[Note: You may use computer programs to solve. But show detailed steps of the
solutions.] Attempt any 15 questions but solving all the problems will carry extra credit.

1. Draw a matrix like the Table (relationship between security services and
mechanisms) that shows the relationship between security services and attacks.

2. Draw a matrix similar to the Table (relationship between security services and
mechanisms) that shows the relationship between security mechanisms and
attacks.
3. Find integer x such that
a. 5x  4 (mod 3) b) 7x  6 (mod 5) c) 9x  8 (mod 7)
4. Prove the following:
a. a  b (mod n) and b  c (mod n) imply a  c (mod n)
b. [(a mod n) - (b mod n)] mod n = (a - b) mod n
c. [(a mod n) * (b mod n)] mod n = (a * b) mod n
5. Show that an integer N is congruent modulo 9 to the sum of its decimal digits.
For example, 475  4 + 7 + 5  16  1 + 6  7 (mod 9).
6. Break the following ciphertext
“PELCGBTENCULVFSBEVASBEZNGVBAFRPHEVGL” which is generated by
monoalphabetic additive substitution cipher.
7. Break the ciphertext “UNTWXEAPUWNUGGKSYXK” which is generated by
monoalphabetic multiplicative substitution cipher.
8. The affine Caesar cipher works as follows.
C=E([K1, K2], P) = P * K1 + K2 P=D([K1, K2], C) = (C - K2) * K1-1
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 K1.
For example, for K1 = 2 and K2 = 3, then E([K1,K2], 0) = E([K1,K2], 13) = 3.
(a)Determine which values of K1 are not allowed.
(b)Are there any limitations on the value of K2? Explain.
9. Decrypt the message “XICKGLTIZKSCRHUFM” by considering the
monoalphabetic substitution scheme as a b c ... x y z ➔Z Y X ... C B A.

10.Break the ciphertext “MTMTCMSALHRDY” which is generated using Auto-key


cipher.
11. Alice and Bob use Playfair cipher for sending messages.
(a) Alice encrypted the plaintext “hello bob come soon” and sent to Bob. The key
used is “VITAPBC$” (replace $ with your specialization, e.g., D/E/N). What is
the ciphertext received by Bob?
(b) What is the plaintext decrypted by Alice if Bob sent the ciphertext
“EOZAIQLNPVLW” using the key “VITAP”?
12.Encrypt the message “solve the assignment individually” with the key “$VITAP”
using columnar transposition cipher. (Replace $ according to your specialization as
mentioned in the below table). Find the Decryption key and decrypt the ciphertext
to get the plaintext.
Note: Encoding the key can be done using sequence of characters in the alphabet.
For example:
Specialization $ Key (String) Key (Numeric)
Artificial Intelligence L LVITAP [3 6 2 5 1 4]
Data Analytics D DVITAP [2 6 3 5 1 4]
Computer Science S SVITAP [4 6 2 5 1 3]
NW & Security Y YVITAP [6 5 2 4 1 3]

13.Alice sent the ciphertext


“TPQSPIZYRRRRCZRGYIOAEPAEEETZCOHUMRC” using keyed-
columnar transposition cipher with encryption key [5 3 2 4 1]. Decrypt the
plaintext.
14.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 “send more money” with the key stream [9 0 1 7 23
15 21 14 11 11 2 8 9].
(b) Using the ciphertext produced in part a, find a key so that the cipher text
decrypts to the plaintext “CASHNOTNEEDED”.
15. Encrypt the message “meet me at the usual place at ten rather than
9 5
eight o clock” using the Hill cipher with the key [ ]. Show your
4 7
calculations and the result. Also show the calculations for the corresponding
decryption of the ciphertext to recover the original plaintext.
16. Decipher the message YITJP GWJOW
FAQTQ XCSMA ETSQU
5 1
SQAPU SQGKC PQTYJ using the Hill cipher with the inverse key [ ].
2 7
Show your calculations and the result.
17.Decipher the message MWALO LIAIW WTGBH JNTAK QZJKA ADAWS
SKQKU AYARN CSODN IIAES OQKJY B using the Hill cipher with the
2 23
inverse key [ ]. Show your calculations and the result.
21 7

18.Encrypt the plaintext P (your registration number) using the Hill cipher. The key
[𝐾] should be also your registration number. [Note: Consider Z13={0,1,…,9, M, I,
S}]
2 0 𝑀
For example, 𝐾 = 𝑃 = 20𝑀𝐼𝑆7123 = [𝐼 𝑆 7 ].
1 2 3
Show your calculations and the result. Also show the calculations for the
corresponding decryption of the ciphertext to recover the original plaintext.

---$---

You might also like