Editing Post Quantum Crypto (section)

== <span style="color: #FFFFFF;">Applying</span> ==
'''Modeling 'The Quantum Advantage' (Classical vs. Quantum):'''
<syntaxhighlight lang="python">
def estimate_crack_time(key_bits, is_quantum):
    """
    Shows why RSA dies and AES survives.
    """
    if is_quantum:
        # Shor's Algorithm 'flattens' the difficulty of RSA
        crack_time = "Seconds"
    else:
        # Standard computer guessing
        combinations = 2 ** key_bits
        crack_time = f"{combinations} operations (Trillions of years)"
        
    return crack_time

# RSA-2048 (The current standard)
print(f"RSA vs Classical: {estimate_crack_time(2048, False)}")
print(f"RSA vs Quantum:   {estimate_crack_time(2048, True)}")
# This is why the world is currently moving to 'Lattice' 
# math for the next generation of HTTPS.
</syntaxhighlight>

; PQC Landmarks
: '''Peter Shor (1994)''' → The mathematician who proved that quantum computers ''could'' break our math, starting the PQC field.
: '''NIST Standard (2022)''' → The announcement of the first 4 "Winners" of the global PQC competition.
: '''Quantum Key Distribution (QKD)''' → A different approach using lasers to send keys; if anyone "looks" at the key, the quantum state collapses and the intrusion is detected.
: '''Hybrid PQC''' → Using ''both'' RSA and a PQC algorithm together; if the new PQC math is found to have a bug, the old RSA math still protects you from classical hackers.
</div>

<div style="background-color: #8B4500; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">