Q3Cyber Security Management

Developed in 1977 by Rivest, Shamir, and Adleman, the RSA algorithm is the undisputed foundational pillar of global Asymmetric (Public-Key) Cryptography. Unlike symmetric systems that use the same key, RSA utilizes two mathematically linked, yet distinct keys: a Public Key (freely distributed to encrypt data) and a Private Key (violently guarded to decrypt data). The absolute security of RSA relies on the catastrophic mathematical difficulty of factoring massively large prime numbers.

Phase 1: Rigorous Key Generation

The generation of the key pair requires strict modular arithmetic:

• 1. Prime Selection: The system aggressively generates two massive, distinct prime numbers, $p$ and $q$ (typically 2048 bits each).
• 2. Compute the Modulus ($n$): The system calculates $n=p\times q$. This value $n$ is a critical component of both the public and private keys and dictates the maximum size of the data block.
• 3. Compute Euler's Totient ($\varphi (n)$): The algorithm calculates the totient: $\varphi (n)=(p-1)\times (q-1)$.
• 4. Select the Public Exponent ($e$): Choose an integer $e$ such that $1<e<\varphi (n)$, and crucially, $e$ must be mathematically coprime to $\varphi (n)$ (meaning their greatest common divisor is exactly 1). The Public Key is the pair $(e,n)$.
• 5. Calculate the Private Exponent ($d$): Calculate $d$ such that it is the modular multiplicative inverse of $e$ modulo $\varphi (n)$. Mathematically: $(d\times e)\equiv 1(\mathrm{mod}\varphi (n))$. The Private Key is the highly secure pair $(d,n)$.
• 6. Destruction: The original prime numbers $p$ and $q$, along with $\varphi (n)$, are violently deleted from RAM to prevent mathematical reverse-engineering.

Phase 2: Encryption

To send a highly secure message $M$ (where $M$ is an integer strictly less than $n$) to the receiver, the sender uses the receiver's Public Key $(e,n)$. The ciphertext $C$ is mathematically calculated via Modular Exponentiation: $$C=M^e(\mathrm{mod}n)$$

Phase 3: Decryption

Upon receiving the scrambled ciphertext $C$, the receiver utilizes their highly guarded Private Key $(d,n)$ to recover the original plaintext message $M$: $$M=C^d(\mathrm{mod}n)$$

Because $d$ is mathematically inextricably linked to the destroyed primes $p$ and $q$, it is computationally impossible for a hacker to derive $d$ from the public variables $(e,n)$ before the end of the universe.