Artwork
iconShare
 
Manage episode 513142076 series 3695172
Content provided by Maitt Saiwyer. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by Maitt Saiwyer or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://staging.podcastplayer.com/legal.

This episode takes a deep dive into the Public Key Infrastructure (PKI), the mathematical bedrock of digital trust, starting with asymmetric cryptography which uses public and private key pairs to solve the problem of securely sharing a secret key. Because asymmetric algorithms like RSA are computationally slow, they are paired with much faster symmetric ciphers like AES in a hybrid approach—the slow asymmetric math encrypts a tiny session key, and the fast symmetric cipher encrypts the large data payload. This architecture is foundational to protocols like TLS (Transport Layer Security), which uses the server's public key certificate for authentication and a Diffie-Hellman key exchange to establish a new, ephemeral symmetric session key for every single connection, a practice known as forward secrecy.

The discussion shifts to the practical engineering needed for speed, such as using specific mathematical structures like Galois Fields (GF(2)) that are efficient in computer hardware for high-speed processes like the TLS handshake. The core of modern security, from key generation to symmetric encryption, depends absolutely on true randomness (entropy), which is harvested from physical processes like electrical noise or mouse movements to "seed" the cryptographic random number generators. This inherent fragility of keys and the complexity of these systems lead to the "configuration crisis," where studies suggest a staggering 97% of real-world data breaches are caused not by breaking the advanced math, but by basic configuration errors, weak passwords, and poor cyber hygiene.

Finally, the conversation addresses the looming quantum threat posed by a future, fault-tolerant quantum computer, which could use Shor's algorithm to break the security of all current public key systems like RSA and ECC. This threat drives the urgent need for a post-quantum cryptography (PQC) migration to new algorithms, like those based on lattice cryptography, to prevent a "capture now, decrypt later" scenario where adversaries store today's encrypted data for future decryption. The episode concludes by asking if the industry is too focused on the fascinating, long-term physics puzzle of quantum computing while neglecting the more mundane, but urgent, task of fixing the basic security configuration and operational failures that cause the vast majority of current security incidents.

  continue reading

21 episodes