Ciro Santilli @cirosantilli 37

Based on the fact that we don't have a P algorithm for integer factorization as of 2020. But nor proof that one does not exist!

The private key is made of two randomly generated prime numbers: $p$ and $q$. How such large primes are found: how large primes are found for RSA.

The public key is made of:

Given a plaintext message m, the encrypted ciphertext version is:This operation is called modular exponentiation can be calculated efficiently with the Extended Euclidean algorithm.

The inverse operation of finding the private m from the public c, e and $n$ is however believed to be a hard problem without knowing the factors of n.

However, if we know the private p and q, we can solve the problem. As follows.

First we calculate the modular multiplicative inverse. TODO continue.

Bibliography:

Front-end web framework integration: no native one:

TODO server-side rendering anyone??

For similar reasons as Section "Regulate the fuck out of advertising".

OMG, Ciro Santilli only learned about this in 2021 after: twitter.com/ryancdotorg/status/1375484757916672000