From bd9be249d662194a64d3d3db1415952862d203d2 Mon Sep 17 00:00:00 2001
From: Aman Priyanshu <aman.priyanshu@learner.manipal.edu>
Date: Mon, 24 Aug 2020 08:29:26 +0530
Subject: [PATCH] Update Chunk Norris.md

---
 Google-CTF-2020/Cryptography/Chunk Norris.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Google-CTF-2020/Cryptography/Chunk Norris.md b/Google-CTF-2020/Cryptography/Chunk Norris.md
index 0e0a053..bff6150 100644
--- a/Google-CTF-2020/Cryptography/Chunk Norris.md	
+++ b/Google-CTF-2020/Cryptography/Chunk Norris.md	
@@ -58,7 +58,7 @@ So all it boils down to is finding the s value of both the primes and we can bre
 
 So if we can get the s values for both of the primes, we can break the encryption!. Let the primes be <img src="https://render.githubusercontent.com/render/math?math=p"> and <img src="https://render.githubusercontent.com/render/math?math=q"> and let the s values for them be <img src="https://render.githubusercontent.com/render/math?math=s_1"> and <img src="https://render.githubusercontent.com/render/math?math=s_2"> respectively.
 
-If we look at the equation for $n$, we can see the 64 MSB bits will be a result of the multiplication of the first term's MSB bits. Similarly the 64 LSB bits will be the result of the product last term's LSB bits. Using these two relation we can basically get the value of $s_1 * s_2$ and then it's just a matter of bruteforcing over it's divisors.
+If we look at the equation for <img src="https://render.githubusercontent.com/render/math?math=n">, we can see the 64 MSB bits will be a result of the multiplication of the first term's MSB bits. Similarly the 64 LSB bits will be the result of the product last term's LSB bits. Using these two relation we can basically get the value of <img src="https://render.githubusercontent.com/render/math?math=s_1 * s_2"> and then it's just a matter of bruteforcing over it's divisors.
 
 <img src="https://render.githubusercontent.com/render/math?math=64 LSB \ bits \equiv [(a^{15}s_1 \mod  2^{64})*(a^{15}s_2 \mod 2^{64}) ]\mod 2^{64} \equiv a^{30}s_1s_2 \mod 2^{64}">