Update for 23-03-22 13:00
This commit is contained in:
parent
6c5b5dd9bc
commit
7f85db3008
@ -12,8 +12,8 @@ large prime numbers.
|
||||
* known as eulers totient
|
||||
3) choose 2 values e and d
|
||||
* where 1 < e < T
|
||||
* where (e * d) mod T = 1
|
||||
* where e and T are [[relative_prime]]s, or coprime
|
||||
* where (e * d) mod T = 1
|
||||
4) we now have our keys
|
||||
* n and e are public keys
|
||||
* n and d are private keys
|
||||
|
Loading…
Reference in New Issue
Block a user