Given two integers a and b, where 𝑎>𝑏. *Divide 𝑎 by 𝑏 ... Choose e such that 1<e<𝜙(𝑛) and e is coprime to 𝜙(𝑛) ie. GCD(e,𝜙(𝑛))=1. ~Calculate Private key d = e^-1 mod 𝜙(𝑛) ~Public key is (n ...

The Chinese Remainder Theorem (which will be referred to as CRT in the rest of this article) was discovered by Chinese mathematician Sun Zi. It's easy to verify that ...