fixed formulas on RSA
This commit is contained in:
parent
6e34adeffa
commit
e1b022b76c
|
@ -4,7 +4,7 @@
|
|||
* Coprime Phi is calculated either by [Euler Totient](https://en.wikipedia.org/wiki/Euler's_totient_function) or [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor) via [euclidean algorithm](https://crypto.stanford.edu/pbc/notes/numbertheory/euclid.html)
|
||||
|
||||
$$
|
||||
1 < $\phi$ < n
|
||||
1 < \phi < n
|
||||
$$
|
||||
|
||||
* There is also
|
||||
|
|
Loading…
Reference in New Issue