Scribd
Upload
5 views

RSA Cipher and Applications

The document discusses RSA cipher operations, including verification of the decryption exponent and decryption of ciphertext. It also covers encryption of the word 'BOONE' and provides a brief history of Julius Caesar's cipher during the Gallic Wars. Additionally, it outlines various real-life applications of RSA encryption, such as secure communication and digital signatures.

Uploaded by

aosvogk
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

RSA Cipher and Applications

The document discusses RSA cipher operations, including verification of the decryption exponent and decryption of ciphertext. It also covers encryption of the word 'BOONE' and provides a brief history of Julius Caesar's cipher during the Gallic Wars. Additionally, it outlines various real-life applications of RSA encryption, such as secure communication and digital signatures.

Uploaded by

aosvogk
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

RSA Cipher and Applications

Here are the solutions to your cryptography assignment questions:

Q1. Consider an RSA cipher with encryption key e = 27 and n = 55, and
correspondences A = 0, B = 1, C = 2, ..., Z = 25.

(a) Verify that the decryption exponent for this cipher is d = 3.

In RSA, the decryption exponent d is found using the modular inverse of e modulo ϕ(n),
where:

n = 55 (since n = p × q , we find p = 5 and q = 11)


ϕ(n) = (p − 1)(q − 1) = (5 − 1)(11 − 1) = 4 × 10 = 40
We need to find d such that:

e×d≡1 mod ϕ(n)

That is,

27 × d ≡ 1 mod 40

Finding the modular inverse of 27 modulo 40:

Using the Extended Euclidean Algorithm, we find that:

27−1 ≡ 3 mod 40

So, d = 3, which verifies the given value.

(b) Decrypt 17, 28, 0, 20, 0, 23 using this cipher.

Decryption formula:

M = Cd mod n

For each ciphertext value C , compute:

1. 173 mod 55 = 17 × 17 × 17 mod 55 = 4913 mod 55 = 8


2. 283 mod 55 = 28 × 28 × 28 mod 55 = 21952 mod 55 = 2
3. 03 mod 55 = 0
4. 203 mod 55 = 20 × 20 × 20 mod 55 = 8000 mod 55 = 30
5. 03 mod 55 = 0

1/4
6. 233 mod 55 = 23 × 23 × 23 mod 55 = 12167 mod 55 = 12

Now, mapping back to letters:

8→I

2→C

0→A

30 → (Not in range 0-25, possibly an encoding error)

0→A

12 → M

So, the decrypted text is "ICA_A_M" (potentially "ICAM" if we ignore errors).

Q2. Consider an RSA cipher with primes p = 3 and q = 11, encryption


exponent e = 7. Use this cipher to encrypt "BOONE".
Step 1: Compute n and ϕ(n)

n = p × q = 3 × 11 = 33

ϕ(n) = (p − 1)(q − 1) = 2 × 10 = 20

Step 2: Convert "BOONE" to numbers


Using A=0, B=1, ..., Z=25:

B=1

O = 14

O = 14

N = 13

E=4

Step 3: Encrypt each letter using C = M e mod n


1. 17 mod 33 = 1
2. 147 mod 33 = 105413504 mod 33 = 8
3. 147 mod 33 = 8

2/4
4. 137 mod 33 = 62748517 mod 33 = 31
5. 47 mod 33 = 16384 mod 33 = 16

Ciphertext: "1, 8, 8, 31, 16"

Q3. Write a short note on the use of Julius Caesar’s encryption during
Gallic Wars.
Julius Caesar used a simple substitution cipher, now known as the Caesar Cipher, during the
Gallic Wars to secure military messages. In this cipher, each letter in the plaintext was shifted
by a fixed number of positions in the alphabet. For example, with a shift of 3, "HELLO" would
become "KHOOR". This method ensured that intercepted messages remained unreadable to
the enemy unless they knew the shift value. While simple by modern standards, the Caesar
cipher was effective in an era without sophisticated code-breaking techniques.

Q4. What are some real-life uses of RSA ciphers?


RSA encryption is widely used in real-world applications, including:

1. Secure Communication – Used in HTTPS, SSL/TLS for secure internet browsing.

2. Email Encryption – Employed in services like PGP (Pretty Good Privacy).

3. Digital Signatures – Used for verifying authenticity in contracts, software updates, and
government documents.

4. Banking and Finance – Used in secure online banking and ATM transactions.

5. Cryptocurrency – RSA plays a role in securing wallets and blockchain transactions.

6. Authentication Systems – Used in two-factor authentication (2FA) and biometric


security.

Final Answers Summary:

3/4
Q1(a): Verified d = 3.
Q1(b): Decrypted text "ICA_A_M".

Q2: Encrypted "BOONE" as "1, 8, 8, 31, 16".

Q3: Explained Julius Caesar’s cipher in the Gallic Wars.

Q4: Listed real-life RSA applications.

Let me know if you need further clarification!

4/4

You might also like