applied-cryptography/appliedcrypto
1
0
Fork 0
mirror of https://github.com/billbuchanan/appliedcrypto.git synced 2026-02-21 11:18:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
Bill Buchanan
2023-02-27 05:17:28 +00:00
committed by GitHub
parent acb7948d08
commit 435d26ce19
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
z_ctf/README.md
View File

@@ -16,6 +16,8 @@ JQpHMvfLrgOeLzO5uH8ToAzySJxXIsJKqKXdL7Y41wyF9+C/ahbZppMzzANrjhWc
pXVqFsHfEJRcW9zZXuxCk20=
-----END ENCRYPTED PRIVATE KEY-----
```
The method is defined [https://asecuritysite.com/openssl/rsa_keygen2](https://asecuritysite.com/openssl/rsa_keygen2).
### Answer
For this we can basically try with a batch file, and substitute colours. This one works:
```
% cat 1.key | openssl rsa -passin pass:blue -text
@@ -69,6 +71,8 @@ VTIsAZLHXvFp
Bob has used the RSA method with three different moduli to encrypt the same message for Alice. These modulus values are 181573934956808382047424502743618497959, 263663189152094019455553753982108272769, and 150466971419052326232703131045351509419. The corresponding ciphered values are 89486828865161621017578261527117772610, 176405275524632787228669332980053978025, and 120736618872251736750094696442087698014. Determine the English city in the message (assume he has used an exponent of 3).
The method is defined [https://asecuritysite.com/cracking/rsa_ctf01](https://asecuritysite.com/cracking/rsa_ctf01).
### Answer
The method is defined [here](https://asecuritysite.com/cracking/rsa_ctf01). In this case, we have used 64-bit primes here and which generates 128-bit modulus values. The values of: