-
Quantum Computing for Cybersecurity Professionals
Part 8: Shor: Cryptanalysis by Physics
Part 8 aims the four-move template at RSA: factoring becomes period-finding, the quantum Fourier transform reads the period through interference, and the same move takes down ECC and Diffie-Hellman. Plus the honest 2025 resource math.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 7: The Shape of a Quantum Algorithm
Part 7 assembles the toolbox into the only recipe that works: prepare, imprint, interfere, measure. Deutsch's one-qubit algorithm runs the whole shape by hand, and the closing transform explains why structure is the entry fee.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 6: Correlations Without a Mechanism
Part 6 defines entanglement with four amplitudes and a factorization test, grants the gloves objection its full due, then breaks it with Bell's arithmetic: a shared recipe scores one-third, the qubits score one-quarter. Nothing communicates.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 5: Vast State, Narrow Door
Part 5 scales to many qubits: 2^n amplitudes of workspace behind a single n-bit measurement. Holevo's bound, the no-cloning theorem, a failed copier that entangles instead, and the long-awaited autopsy of "tries every answer at once."
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 4: The Impossible Coin
The keystone of the series: a two-stage device returns certainty from a perfect fair coin, classical probability proves that impossible, and four lines of arithmetic show the amplitudes colliding. Part 2's receipt comes due.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 3: Quantum Amplitudes: The One New Rule
Part 3 adds the only new rule in quantum mechanics: uncertainty described by numbers that can be negative. Amplitudes, the Born rule, an honest definition of superposition, and a minus sign no single measurement can see.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 2: The Classical Bit You Don’t Know Yet
Part 2 formalizes the classical bit: a definite value, probabilities that measure your ignorance, and a two-line proof that recordless mixing never un-mixes. Every belief here is true. One of them is about to matter.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 1: What a Quantum Computer Is Not
The popular story of quantum computing gets the professionally important details backwards. Part 1 clears the category error, previews the cryptographic casualty list, and sets your real deadline, which arrives well before Q-Day.
Read More » -
Industry
ETH Zurich and PSI Launch Joint Quantum Computing Hub
May 2021 - ETH Zurich and the Paul Scherrer Institute (PSI) opened a new joint Quantum Computing Hub dedicated to developing next-generation quantum computers. Backed by CHF 32 million from ETH, the center in canton Aargau brings together about 30…
Read More » -
Post-Quantum, PQC, Quantum Security
Evaluating Tokenization in the Context of Quantum Readiness
As the quantum era approaches, organizations face the daunting task of protecting their sensitive data from the looming threat of quantum computers. These powerful machines have the potential to render traditional cryptographic methods obsolete, making it imperative to explore innovative…
Read More » -
Research
Breaking RSA-2048 With 20M Noisy Qubit
An interesting paper was published on arXiv, the preprint server. Titled “How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits,” the paper by Craig Gidney and Martin Ekerå combines previous techniques from Shor (1994),…
Read More » -
Post-Quantum, PQC, Quantum Security
Quantum Computing – Looming Threat to Telecom Security
Since the early 2000s, the field of quantum computing has seen significant advancements, both in technological development and in commercialization efforts. The experimental demonstration of Shor's algorithm in 2001 proved to be one of the key catalyzing events, spurring increased…
Read More » -
Post-Quantum, PQC, Quantum Security
Adiabatic Quantum Computing (AQC) and Impact on Cyber
Adiabatic Quantum Computing (AQC), and its variant Quantum Annealing, are another model for quantum computation. It's a specialized subset of quantum computing focused on solving optimization problems by finding the minimum (or maximum) of a given function over a set…
Read More » -
Quantum Computing
Routing Quantum Information: SWAP, iSWAP, and Moving Qubit States
Quantum computers face a unique challenge in moving quantum information between qubits. Unlike classical bits that can be shuttled freely along wires, qubits cannot be arbitrarily copied or moved due to the no-cloning theorem. To route a qubit’s state from…
Read More » -
Quantum Computing
Surface Code Quantum Error Correction
Quantum error correction (QEC) is indispensable for building large-scale fault-tolerant quantum computers. Even today’s best qubits suffer error rates that would quickly corrupt any long calculation if left uncorrected. The principle of QEC is to encode a single logical qubit…
Read More »