Differences

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

--- network_stuff:cryptography [2024/12/16 12:47] – jotasandoku
+++ network_stuff:cryptography [2024/12/19 21:25] (current) – jotasandoku
@@ Line 130: / Line 130: @@
 {{:rsa-formula-1.png?200|}}
 \\
-Very succint and clear [[https://www.johndcook.com/blog/2018/12/12/rsa-exponent/|HERE!]]
+Very succinct and clear [[https://www.johndcook.com/blog/2018/12/12/rsa-exponent/|HERE!]]
-  * e, d and n : very large positive integers
+Components:
-  * Public Key Info: n,e,key-size(n size in bits) :  public key encryption . n is coming from multiply to big numbers pq , e is normally 65537
-  * d: private key (decryption)
+  * m: Your original message (converted to a number)
-  * m : message
+  * e: Public encryption exponent (usually 65537, which is 2^16 + 1)
+  * d: Private decryption key (kept secret)
+  * n: The modulus (also public)
+  encrypted = (message ^ e) mod n
+  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)
+  - (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