Differences

This shows you the differences between two versions of the page.

--- network_stuff:cryptography [2024/12/19 21:24] – jotasandoku
+++ network_stuff:cryptography [2024/12/19 21:25] (current) – jotasandoku
@@ Line 141: / Line 141: @@
   decrypted = (encrypted ^ d) mod n
-There's a mathematical relationship between e, d, and n that makes RSA work. If someone could factor n into p and q, they could calculate d using a formula that connects them all. To calculate d, you need to know: e (which is public)
+There's a mathematical relationship between e, d, and n that makes RSA work. If someone could factor n into p and q, they could calculate d using a   - formula that connects them all. To calculate d, you need to know: e (which is public)
-(p-1) and (q-1)
+  - (p-1) and (q-1)
+  - p and q are like the blueprint for making copies of the key
+  - n being hard to factor means no one can recreate the blueprint, even though they can see the lock
 [[https://www.comparitech.com/blog/information-security/rsa-encryption/|Process:]]

dokucama