All Post-Quantum, PQC Posts
-
Post-Quantum, PQC, Quantum Security
The Future of Digital Signatures in a Post-Quantum World
The world of digital signatures is at an inflection point. We’re moving from the familiar terrain of RSA and ECC into the new territory of lattices and hashes. It’s an exciting time for cryptography, and a critical time for security practitioners. Authentication, integrity, and non-repudiation are security properties we must preserve at all costs, even in the face of revolutionary computing technologies. With careful preparation,…
Read More » -
Post-Quantum, PQC, Quantum Security
Cryptographically Relevant Quantum Computers (CRQCs)
Cryptographically Relevant Quantum Computers (CRQCs) represent a seismic shift on the horizon of cybersecurity. In this article, we’ve seen that CRQCs are defined by their ability to execute quantum algorithms (like Shor’s and Grover’s) at a scale that breaks the cryptographic primitives we rely on daily. While still likely years (if not a decade or more) away, their eventual arrival is not a question of…
Read More » -
Post-Quantum, PQC, Quantum Security
Quantum Computer Factors Record 48-Bit Number – How Far Are We from Cracking RSA-2048?
Factoring a 2048-bit number is in a different universe of complexity, requiring thousands of high-quality qubits and billions of operations – a capability that will likely require years of additional scientific and engineering breakthroughs. The current milestone, while remarkable for quantum computing, does not change the security status of RSA or other cryptographic systems. It does, however, add momentum to the quantum computing race and…
Read More » -
Post-Quantum, PQC, Quantum Security
Engaging and Managing Vendors for Quantum Readiness
Vendors provide critical software, cloud platforms, fintech solutions, IoT devices, and more - and these often rely on vulnerable cryptographic algorithms under the hood. If a key vendor lags in upgrading their encryption, it could expose your data or systems to quantum-enabled attacks. Engaging vendors early allows you to:
Read More » -
Quantum Computing
The Toffoli Gate: The Unsung Workhorse in Quantum Codebreaking
Understanding the Toffoli gate’s role isn’t just an academic exercise – it has real implications for when and how quantum computers might break our cryptography. Each Toffoli gate isn’t a single physical operation on today’s hardware; it has to be decomposed into the basic operations a quantum machine can do (typically one- and two-qubit gates). In many quantum architectures, a Toffoli might be broken down…
Read More » -
Post-Quantum, PQC, Quantum Security
Mitigating Quantum Threats Beyond PQC
The article explores limitations of PQC and explores alternative and complementary approaches to mitigate quantum risks. It provides technical analysis of each strategy, real-world examples of their deployment, and strategic recommendations for decision-makers. The goal is to illuminate why a diversified cryptographic defense – beyond just rolling out new algorithms – is essential to achieve long-term resilience against quantum-enabled adversaries.
Read More » -
Post-Quantum, PQC, Quantum Security
Introduction to Crypto-Agility
As we edge closer to the Q-Day—the anticipated moment when quantum computers will be capable of breaking traditional cryptographic systems—the need for crypto-agility becomes increasingly critical. Crypto-agility is the capability of an organization to swiftly and efficiently transition between different cryptographic algorithms and protocols in response to emerging threats and technological advancements.
Read More » -
Post-Quantum, PQC, Quantum Security
Post-Quantum Cryptography (PQC) Introduction
Post-Quantum Cryptography (PQC) refers to cryptographic algorithms (primarily public-key algorithms) designed to be secure against an attack by a future quantum computer. The motivation for PQC is the threat that large-scale quantum computers pose to current cryptographic systems. Today’s widely used public-key schemes – RSA, Diffie-Hellman, and elliptic-curve cryptography – rely on mathematical problems (integer factorization, discrete logarithms, etc.) that could be easily solved by…
Read More »
