Mirrors/h4cker
2
0
Fork 0
mirror of https://github.com/The-Art-of-Hacking/h4cker synced 2024-11-22 02:43:02 +00:00
Code Issues Projects Releases Packages Wiki Activity

Update 02_Diffie_Hellman_Key_Exchange.md

Browse source
This commit is contained in:
Omar Santos 2023-08-15 09:51:13 -04:00 committed by GitHub
parent 7e6191bede
commit 0b157a639e
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 16 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

19
crypto/challenges/02_Diffie_Hellman_Key_Exchange.md
View file

@ -12,24 +12,11 @@ n = 3233, e = 17, Encrypted message: [2201, 2332, 1452]
### Answer: ### Answer:
Here are the detailed solutions for each step:
**Step 1:** Factorize \( n = 3233 \) into two prime numbers: <img width="1230" alt="image" src="https://github.com/The-Art-of-Hacking/h4cker/assets/1690898/b4919061-0736-4884-9f44-51f0a53fdcc6">
\( p = 61 \), \( q = 53 \)
**Step 2:** Compute the Euler's Totient function \( \phi(n) \):
\( \phi(n) = (p-1)(q-1) = 3120 \)
Compute the private key \( d \) such that: Code snippet in Python to perform the entire decryption:
\( de \equiv 1 \mod \phi(n) \)
Using Extended Euclidean Algorithm, we can find:
\( d = 2753 \)
**Step 3:** Decrypt the message using the private key:
Decrypted message: "HEY"
Here's a code snippet in Python to perform the entire decryption:
```python ```python
def egcd(a, b): def egcd(a, b):
@ -61,4 +48,4 @@ decrypted_text = decrypt_rsa(ciphertext, n, e)
print(decrypted_text) # Output: "HEY" print(decrypted_text) # Output: "HEY"
``` ```
This challenge provides an understanding of the RSA algorithm, which is foundational in modern cryptography. It covers important concepts like prime factorization, modular arithmetic, and key derivation. This challenge provided you with an understanding of the RSA algorithm. It covered important concepts like prime factorization, modular arithmetic, and key derivation.