All Post-Quantum, PQC Posts
-
Post-Quantum
Mosca’s Theorem and Post‑Quantum Readiness: A Guide for CISOs
Mosca’s Theorem is a risk framework formulated to help organizations gauge how urgent their post-quantum preparations should be. It is often summarized by the inequality X + Y > Q, where: X = the length of time your data must remain secure (the required confidentiality lifespan of the information). Y = the time required to migrate or upgrade your cryptographic systems to be quantum-safe (your…
Read More » -
Q-Day
Q-Day (Y2Q) vs. Y2K
In the late 1990s, organizations worldwide poured time and money into exorcising the “millennium bug.” Y2K remediation was a global scramble. That massive effort succeeded: when January 1, 2000 hit, planes didn’t fall from the sky and power grids stayed lit. Ever since, Y2K has been held up as both a model of proactive risk management and, paradoxically, a punchline about overhyped tech doomsaying. Today,…
Read More » -
Quantum Computing
What’s the Deal with Quantum Computing: Simple Introduction
Quantum computing holds the potential to revolutionize fields where classical computers struggle, particularly in areas involving complex quantum systems, large-scale optimization, and cryptography. The power of quantum computing lies in its ability to leverage the principles of quantum mechanics—superposition and entanglement—to perform certain types of calculations much more efficiently than classical computers.
Read More » -
Post-Quantum
Introduction to Quantum Random Number Generation (QRNG)
Cryptographic systems rely on the unpredictability and randomness of numbers to secure data. In cryptography, the strength of encryption keys depends on their unpredictability. Unpredictable and truly random numbers—those that remain secure even against extensive computational resources and are completely unknown to adversaries—are among the most essential elements in cryptography and cybersecurity.
Read More » -
Post-Quantum
Sign Today, Forge Tomorrow (STFT) or Trust Now, Forge Later (TNFL) Risk
Sign Today, Forge Tomorrow (STFT) or Trust Now, Forge Later (TNFL) is the digital‑signature equivalent of HNDL. Digital signatures underpin everything from software updates and firmware integrity to identity verification and supply‑chain provenance. Today’s signatures are based on RSA or ECDSA, which quantum computers will also break. When that happens, adversaries won’t just read secrets - they will forge signatures at will. The term Sign-Today-Forge-Tomorrow…
Read More » -
Post-Quantum
The Challenge of IT and OT Asset Discovery
Every CISO understands the simple truth: you can’t protect what you don’t know you have. A comprehensive inventory of IT and OT assets - from servers and laptops to industrial controllers and IoT sensors - is the foundation of effective cybersecurity. In theory, building this asset inventory sounds straightforward. In practice, it’s one of the hardest tasks in cybersecurity today. Many enterprises find that even…
Read More » -
Post-Quantum
Brassard–Høyer–Tapp (BHT) Quantum Collision Algorithm and Post-Quantum Security
The Brassard–Høyer–Tapp (BHT) algorithm is a quantum algorithm discovered in 1997 that finds collisions in hash functions faster than classical methods. In cryptography, a collision means finding two different inputs that produce the same hash output, undermining the hash’s collision resistance. The BHT algorithm theoretically reduces the time complexity of finding collisions from the classical birthday-paradox bound of about O(2n/2) (for an n-bit hash) down…
Read More » -
Post-Quantum
Shor’s Algorithm: A Quantum Threat to Modern Cryptography
Shor’s Algorithm is more than just a theoretical curiosity – it’s a wake-up call for the security community. By understanding its principles and implications, we can appreciate why the cryptographic landscape must evolve. The goal of this guide is to equip you with that understanding, without delving into complex mathematics, so you can make informed decisions about protecting your organization’s data against the quantum threat.
Read More »
