Ciro Santilli @cirosantilli 37

Theorized for the graviton.

Phenomena that produces photons in pairs as it passes through a certain type of crystal.

You can then detect one of the photons, and when you do you know that the other one is there as well and ready to be used. two photon interference experiment comes to mind, which is the basis of photonic quantum computer, where you need two photons to be produced at the exact same time to produce quantum entanglement.

so the solution is:We notice that the solution has continuous spectrum, since any value of $E$ can provide a solution.

Makes RNA from RNA.

Used in Positive-strand RNA virus to replicate.

I don't think it's present outside viruses. Well regulated organisms just transcribe more DNA instead.

Model B V 1.1.

SoC: BMC2836

Show up in the solution of the quantum harmonic oscillator after separation of variables leading into the time-independent Schrödinger equation, much like solving partial differential equations with the Fourier series.

I.e.: they are both:

Lecture notes: Quantum Field Theory lecture notes by David Tong (2007).

By David Tong.

14 1 hours 20 minute lectures.

The video resolution is extremely low, with images glued as he moves away from what he wrote :-) The beauty of the early Internet.

This book really tries to recall basic things to ensure that the reader will be able to understand the more advanced ones.

Sometimes it goes a little bit overboard, like defining what a function does several times.

But Ciro Santilli really prefers it when authors error on the side of obvious.

This is very widely used in courses as of 2020, it became kind of the default book.

Unfortunately, this approach bores Ciro Santilli to death. Or perhaps is too just advanced for him to appreciate. Either of those.

800+ pages.

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: