University : RMIT University UniLearnO is not sponsored or endorsed by this college or university.
Subject Code : COSC25362537
Assignment Task:

1. Overview
The objective of Assignment 1 is evaluating your knowledge on the topics covered in Lecture 1-4. Topics include Basic Cryptographic Techniques, Data Encryption Standard (DES), and Public-Key Techniques (RSA and ElGamal cryptosystems). Assignment 1 will focus on developing your abilities in application of knowledge, critical analysis and decision making. Assignment 1 contains several problems related to the topics mentioned above. You are required to prepare the solutions and upload them as a single PDF or Word document in CANVAS. In this assignment, there are 5 (five) questions in total. The first question Q1 is on Playfair Cipher. Q1 has three parts. In the first part, you are expected to construct a Playfair Matrix. In the second part, you are expected to perform Playfair encryption. In the last part, you are expected to analyse the possible keys of Playfair Cipher. The second question Q2 is on Security Analysis. The term security analysis is used to breach security systems and gain access to the contents of encrypted messages, even if the secret key is unknown. Therefore, you are expected to apply security analysis in order to obtain plaintext from the given ciphertext in Q2. The third question Q3 is about the Data Encryption Standard (DES). Q3 has two parts. In the first part, you are expected to generate the first round key of DES. In the second part, you are expected to perform one round encryption of DES completely. Through this question, you are expected to understand the encryption process of DES in details.
The fourth question Q4 is related to RSA Encryption Algorithm and break the RSA Algorithm. This question has three parts. In this first part, you are expected to demonstrate your understanding of the RSA encryption algorithm. Values of required parameters are provided including the plaintext or message M and you should demonstrate the key generation, encryption and decryption processes with detail computations and brief explanations. Marks will be deducted if you fail to show the detail computation correctly, skip the computation steps, or do not provide explanations. In the second part, you are expected to determine the plaintext M from the ciphertext C without knowing the RSA private-key. Public-key parameters and ciphertext are provided to you. You should demonstrate the detail steps with explanations how the RSA encryption algorithm can be broken. Marks will be deducted if you fail to show the detail computation correctly, skip the computation steps, or do not provide explanations. The last part is to analyze the security of RSA. The fifth question Q5 is related to ElGamal Encryption Algorithm. The question has two parts. In the first part, you are expected to demonstrate your understanding of the ElGamal encryption algorithm. Values of required parameters are provided including the plaintext or message M and you should demonstrate the key generation, encryption and decryption processes with detail computations and brief explanations. Marks will be deducted if you fail to show the detail computation correctly, skip the computation steps, or do not provide explanations. In the second part, you are expected to compare RSA and ElGamal algorithms.

Q1. Playfair Cipher (COSC2536/2537)
The best-known multiple-letter encryption cipher is the Playfair Cipher, which treats pairs in the plaintext as singleunits and translates these units into ciphertext pairs.

(a) Construct a Playfair matrix with your full name.
(b) Encrypt your tutor’s full name with the Playfair matrix constructed in (a).
(c) How many possible keys does the Playfair cipher have? Express your answer as an approximate power of 2.
(d) Some Playfair keys produce the same encryption results. If Playfair keys which produce the same encryption results are considered to be equivalent, how many different keys does the Playfair cipher have?

Q2. Security Analysis
Assume that the following ciphertext has been produced using a monoalphabetic cipher. Please note that it may not be a general Caser substitution. The ciphertext is as follows:
EMHYZBOMEF VY BZYN NCJVAMIIC QVYNEVWUNFQ NSEZUGS YJMB FBMVI MNNMAKY. NSF YJMB FBMVI OVII SMRF MH MNNMASBFHN QVYGUVYFQ MY M IFGVNVBMNF TVIF ZE OVII VHAIUQF M UEI IVHK VH NSF WZQC ZT NSF FBMVI. VT NSF TZEBFE BFNSZQ VY UYFQ, NSF EMHYZBOMEF JEZGEMB VY MANVRMNFQ MY YZZH MY NSF MNNMASBFHN VY ZJFHFQ MHQ OVNSVH YFAZHQY, YNMENY NZ FHAECJN TVIFY ZH NSF QFRVAF. VT NSF MNNMAK RFANZE VY M IVHK, UJZH AIVAKVHG VN NSF UYFE VY NMKFH NZ M OFW JMGF OSFEF NSF EMHYZBOMEF VY QFIVRFEFQ NZ NSF QFRVAF UHWFKHZOHYN NZ NSF UYFE. NSF BMIVAVZUY JEZGEMBY ZE YVNFY ZTNFH UYF FXJIZVN KVNY NZ QFNFAN VT NSFEF MEF YFAUEVNC RUIHFEMWVIVNVFY VH NSF QFRVAF’Y ZJFEMNVHG YCYNFB ZE MJJIVAMNVZHY NSMN AMH WF UYFQ NZ QFIVRFE MHQ MANVRMNF NSF EMHYZBOMEF. MQQVNVZHMIIC, ACWFE AEVBVHMIY BMC UNVIVDF FXVYNVHG FXJIZVNY MY YFFH VH NSF EFAFHN OMHHMAEC MNNMAK, OSVAS NZZK MQRMHNMGF ZT M OFII-QZAUBFHNFQ OVHQZOY RUIHFEMWVIVNC KHZOH MY FNFEHMIWIUF.

Q3. Data Encryption Standard (Marks: 4) (COSC2536/2537)
The Data Encryption Standard is a symmetric-key block Cipher based on Feistel structure. It uses 16 rounds of Feistel structure. This question provides a numerical example of encryption using a one round version of DES. Assume that you are sending your student ID and your full name to your tutor and decide to encrypt the information with DES.

Start with the following input:
K (key): Hexadecimal – 0 1 2 3 4 5 6 7 8 9 A B C D E F
Binary – 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111
P (plaintext): your student ID and your full name

Binary – please covert your student ID and your full name into ASC II codes Now perform a round of encryption on the first 64-bit plaintext using DES, writing out the following steps:
(a) Derive K 1 , the first-round sub-key
(b) Derive L 0 and R 0
(c) Expand R 0 to get E[R 0 ], where E[·] is the expansion function
(d) Calculate A=E[R 0 ]K 1
(e) Group the 48-bits result of (d) into sets of 6 bits and evaluate the corresponding S-box substitutions
(f) Concatenate the results of (e) to a 32-bit result, B
(g) Apply the permutation to get P(B)
(h) Calculate R 1 =P(B)L 0
(i) Write down the result of ciphertext (L 1 ,R 1 )
(j) Count the numbers of substitutions and permutations in the round of encryption.

Q4. RSA Encryption Algorithm / Breaking RSA  (COSC2536/2537)

(a) Say, Alice and Bob are two agents in the federal security services. Alice wants to send a secret message to Bob by encrypting the secret message. In other words, Alice is the sender and Bob is the receiver of the secret message. However, Alice and Bob have never contacted before. Therefore, they do not have any shared secret
key. As a result, they have to use Public-Key Encryption techniques. Bob generates public and private keys using RSA encryption algorithm and sends the public key to Alice. Alice encrypts her secret message using RSA encryption and sends the encrypted message to Bob. Consider that Alice has a secret message M=2345 to
send to Bob. Bob uses parameter p = 1483 and q = 761, and chooses the largest prime factor of your student number as the public key e. What is the private key of Bob? How would Alice encrypt message M=2345? How would Bob decrypt the encrypted message C with the private key? You need to show every step.

(b) By integer factorisation, we may be able to decrypt the RSA ciphertext without knowing the private key. Say, Trudy is an intelligent hacker who knows RSA encryption algorithm and integer factorisation very well. Hence, she has been hired by someone who wants to know the secret message between Alice and Bob. Trudy uses
her understanding on the integer factorisation-based RSA security analysis techniques for retrieving Alice and Bob’s secret message. Assume that Alice wants to send a message to Bob. Bob generates public and private keys using RSA encryption algorithm and publishes the public key (n=614281, e=47). Alice has a secret message M to send. She encrypts the message M using the public key and generates the ciphertext C=11184. Alice sends the encrypted message C=11184 to Bob. Trudy captures the encrypted message C=11184. She also has the public key (n=614281, e=47) because it is known to all. How can Trudy decrypt the encrypted message C and find the value of M? Show all the steps. How can Trudy verify if she has computed the correct message
or not?
(c) Generate four RSA public modulo n with 64, 112, 256 and 512 bits, respectively. How long does it take to factorise each of the four RSA public modulo n? Show the relation between the size of RSA public modulo n and the time for factorising n with a diagram.

Q5. ElGamal Encryption algorithm  (COSC2536/2537)

(a) From a reliable source, Alice and Bob came to know that their message is being captured by someone. Therefore, Alice and Bob decide to use ElGamal encryption algorithm for their next communication. Alice has a message M=50 to send to Bob. Bob chooses p=6361, g=19, and x=187. Alice chooses a random number for
encryption. Show the encryption and decryption steps.
(b) By solving discrete logarithm, we may be able to decrypt the ElGamal ciphertext without knowing the private key. Suppose that Trudy is an intelligent hacker who knows the ElGamal encryption algorithm and solving discrete logarithm very well. Assume that Alice wants to send a message to Bob. Bob generates public and private keys using the ElGamal encryption algorithm and publishes the public key (p=6361, g=19, y=3328). Alice has a secret message M to send. She encrypts the message M using the public key and generates the ciphertext C=(2941, 1265). Alice sends the encrypted message C to Bob. Trudy captures the encrypted message C. She also has the public key (p=6361, g=19, y=3328). How can Trudy decrypt the encrypted message C and find the value of M? Show all the steps. How can Trudy verify if she has computed the correct message or not?
(c) Compare key generation, encryption/decryption between ElGamal and RSA in terms of performance.

This COSC2536/2537: Computer Science Assignment has been solved by our Computer Science Experts at UniLearnO. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.

Eureka! You've stumped our genius minds (for now)! This exciting new question has our experts buzzing with curiosity. We can't wait to craft a fresh solution just for you!

  • Uploaded By : Mia
  • Posted on : April 01st, 2019

Whatsapp Tap to ChatGet instant assistance