commit d5a38f561b7ed8fd812e6bf7675d826a781f5183
parent 4050c40c05715ec9d326aeadf5c52fbc89cfc751
Author: Jared Tobin <jared@jtobin.io>
Date: Sat, 26 Aug 2023 18:58:10 -0230
Fix markdown rendering error.
Diffstat:
1 file changed, 6 insertions(+), 6 deletions(-)
diff --git a/docs/s5.md b/docs/s5.md
@@ -364,12 +364,12 @@ I used cryptonite's Crypto.Number.Prime module, which implements the
above procedure.
In any case, RSA: one finds two k-bit primes, 'p' and 'q', and uses
-their product to construct a public modulus n = pq and value `t = (p -
-1) (q - 1)`. The public key is (n, e) for 'e' a number relatively prime
-to 't', and the private key is (n, d), for d such that `ed = 1 mod t`
-(i.e., 'd' is congruent mod 't' to the inverse of 'e'). "Relatively
-prime" or "coprime" means, for two numbers 'a' and 'b', that they have a
-greatest common denominator of 1.
+their product to construct a public modulus n = pq and value
+`t = (p - 1) (q - 1)`. The public key is (n, e) for 'e' a number
+relatively prime to 't', and the private key is (n, d), for d such that
+`ed = 1 mod t` (i.e., 'd' is congruent mod 't' to the inverse of 'e').
+"Relatively prime" or "coprime" means, for two numbers 'a' and 'b', that
+they have a greatest common denominator of 1.
Encryption and decryption are then just modular exponentiation
operations using the keys. To go from Natural to ByteString and back,
