All Post-Quantum, PQC Posts
-
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
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 » -
Post-Quantum
Grover’s Algorithm and Its Impact on Cybersecurity
Grover’s algorithm was one of the first demonstrations of quantum advantage on a general problem. It highlighted how quantum phenomena like superposition and interference can be harnessed to outperform classical brute force search. Grover’s is often described as looking for “a needle in a haystack” using quantum mechanics.
Read More » -
Post-Quantum
Quantum-Safe vs. Quantum-Secure Cryptography
In 2010, I was serving as an interim CISO for an investment bank. During that time, I was already trying to figure out the risks posed by quantum computing. One day, I was approached by a vendor who, with great confidence, made two bold claims. First, they insisted that the Q-Day is just around the corner, claiming they had insider information from the NSA suggesting…
Read More » -
Quantum Computing
Qubits: A Brief Introduction for Cybersecurity Professionals
A qubit is the quantum analog of a classical bit – it’s the basic unit of quantum information. However, unlike a classical bit that can only be 0 or 1 at any given time, a qubit can exist in a combination of both 0 and 1 states simultaneously. This property is called superposition.
Read More » -
Quantum Computing
Bell States: An Introduction for Cybersecurity Professionals
Bell states are a set of four specific quantum states of two qubits (quantum bits) that are entangled. In simple terms, an entangled pair of qubits behaves as one system, no matter how far apart they are. Bell states are the simplest and most extreme examples of this phenomenon. They are fundamental to quantum mechanics because they exhibit correlations between particles that have no classical…
Read More »
