Scribd
Upload
23 views2 pages

Is Assignment #4

The assignment focuses on experimenting with the RSA algorithm through three tasks: implementing RSA for numbers 1 to 99, generating and using RSA key pairs to encrypt 'hello world', and attempting to break a given RSA encryption using provided ciphertext and keys. Students are required to submit their implementations as specified and will be evaluated on their understanding during a viva. The deadline for submission is May 9, 2025.

Uploaded by

malaikasmjad163
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
23 views2 pages

Is Assignment #4

The assignment focuses on experimenting with the RSA algorithm through three tasks: implementing RSA for numbers 1 to 99, generating and using RSA key pairs to encrypt 'hello world', and attempting to break a given RSA encryption using provided ciphertext and keys. Students are required to submit their implementations as specified and will be evaluated on their understanding during a viva. The deadline for submission is May 9, 2025.

Uploaded by

malaikasmjad163
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Information Security

CSC-201
Assignment #04 (CLO Mapping -> CLO 4)

Objective:
Experimenting with RSA

Task #1: RSA implementation (10 points)


Implement the RSA algorithm. Your program should be able to encrypt and
decrypt any number from 1 to 99.
Submit your implementation file 4.1_my_rsa.py
Task #2: Generating rsa-key pair and using them (10)

Generate rsa key pair using ‘ssh-keygen’. Use these private and public keys to
encrypt and decrypt “hello world”.
Submit your code on 4.2_rsa_key.py

Task #3: Breaking the RSA (20 points)


Files
1. 4.3_ciphertext.hex: ciphertext in hex string
2. 4.4_public_key.hex: public key in hex string
3. 4.5_modulo.hex: RSA modulo in hex string

Let’s see if you can break the RSA. You are given a ciphertext in 4.3_ciphertext.hex that
was encrypted with 1024-bit RSA using the key in 4.4_public_key.hex and the modulo
in 4.5_modulo.hex. You do not know the necessary key to decrypt this ciphertext, but
you do know that there is a weakness in this RSA key pair that makes it vulnerable to
one of the attacks discussed in class (Please do not ask for the computation time and
power consumption of our machine). The plaintext that was encrypted is a decimal
integer number < the RSA modulo with a certain pattern that should be obvious when
you decrypt it (The pattern is visible when the number is in its decimal representation,
not hex). Your task is to find the private key and the decrypt the ciphertext to get the
plaintext.

Submission Instructions:
1. Assignments will be evaluated on Friday from 12-2pm, i.e. 9 May, 2025.
2. All the required files are attached.
3. Understanding of each question will be evaluated in viva.
4. Assignment will be evaluated only in executable form.
5. This assignment is individual.
6. For any query you may ask any time.

Deadline:
9 May, 2025.

You might also like