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

Update README.md

Browse Source
This commit is contained in:
Bill Buchanan
2023-02-27 06:36:00 +00:00
committed by GitHub
parent baf27478d8
commit 21ab72e02a
1 changed files with 21 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
z_ctf/README.md
View File

@@ -107,4 +107,25 @@ Plaintext message recovered: stirling
Other information: p=753157364191008241, q=955204000626999853, bits=60, cipher1=209638380732875581317199500772023869, cipher2=56248192157359843908741632748142357
## Fermat's attack
Bob has used RSA to cipher a message to Alice. The cipher value is 19523604121706482215558200036877169200 with a modulus of 102424133664786548527964377021117628383 and using e=65537. His generator, though, has created the two primes numbers fairly near to each other. Using this information, find the original message.
Theory: [https://asecuritysite.com/cracking/fermat_fact](https://asecuritysite.com/cracking/fermat_fact)
### Answer:
```
C: 19523604121706482215558200036877169200
N: 102424133664786548527964377021117628383
Number of bits in p and q: 64
Number of bits in modulus (N): 128
p= 10120480900865301167
q= 10120480900866013649
d= 42017071785064716978655477336057510113
PHI= 102424133664786548507723415219386313568
Message: b'swansea'
```