I see the generative AI fad with its "hallucinations" & other mishaps as a giant, annoying, slow-rolling bubble (that we might never see completely burst in our lifetimes since companies continue to invest so much in the #tech).

Whereas - quantum computing is potentially a serious long-term #cybersecurity threat that could break the internet and is therefore a much bigger deal.

#QuantumComputing #cryptography #business #finance #MyThoughts
--
https://www.forbes.com/sites/digital-assets/2026/03/31/google-finds-quantum-computers-could-break-bitcoin-sooner-than-expected/
--
https://ig.ft.com/quantum-computing/

Google Finds Quantum Computers Could Break Bitcoin Sooner Than Expected

Google published a paper on March 31 that states that Bitcoin's cryptography could be impacted by quantum computing sooner than previously stated.

Forbes

Well, it’s good that someone is drawing a line in the Crypto sand.

Google accelerates its readiness timeline to prepare for “Q-day” with post-quantum cryptography (PQC) migration to 2029. Reminder: Q-day = the date when quantum computing becomes operational and is powerful enough to break the digital signatures that secure the Internet, crypto (blockchain + Ethereum), and just about every other Information system in use today.

The Bitcoin crypto network relies on ECDSA elliptic curve signatures. https://techaptitude.substack.com/p/ecdsa-cryptographys-role-in-securing With an exposed crypto signature public key, a quantum computer could derive the private key. And then, the crypto assets would be freely available to a hacker.

Android 17 will integrate ML-DSA, an algorithm standardized by the NIST to secure digital signatures. https://security.googleblog.com/2026/03/post-quantum-cryptography-in-android.html

https://blog.google/innovation-and-ai/technology/safety-security/cryptography-migration-timeline/ #Crypto #PQC #PostQuantumCryptography #Cryptography #Google #Quantum #QuantumComputing #Q-Day #BlockChain #ECDSA #NIST #ML-DSA #Security #CryptoSecurity #Internet #TechAptitude

If your security depends on someone reacting in time,
you don’t have a guarantee. You have coordination.

Wrote about a real failure mode that keeps showing up.
https://app.daily.dev/posts/yqybiiFvJ

#blockchain #smartcontracts #security #formalmethods #web3 #cryptography #defi #ethereum #protocoldesign

On-Chain Finality and Off-Chain Assumptions: A Failure Mode in Dispute Resolution Systems | daily.dev

Blockchain dispute resolution systems often present themselves as deterministic, but many rely on a hybrid model combining on-chain state machines with...

daily.dev
Web PKI Reimagined with Merkle Tree Certificates

0 comments

Lobsters

RE: https://mastodon.social/@fj/116323066703142504

Providing a ZKP while keeping the algorithm secret seems misguided for the following reasons:

1. It is ineffective against dangers. For anyone with the capability to be among the first to build/access a physical implementation, recreating the work is only a minor hurdle knowing a solution exists. The proof provides incentive and certainty to justify redoing the work.

2. It unmotivates academic researchers. A ZKP turns original research into a homework assignment for others.

#cryptography #quantumcomputing

Two coordinated quantum cryptanalysis papers yesterday — same day, interlinked, complementary threat models:

Google (Babbush, Gidney, Zalcman + Ethereum Foundation + Stanford): ECDLP-256/secp256k1 compiled to surface code on planar superconducting arch. <500K physical qubits, ~9 min primed. Circuits withheld, verified via Groth16 SNARK over SP1 zkVM.

Oratomic (Cain, Xu, Bluvstein, Preskill, Endres, Huang): Same Google circuits compiled to high-rate lifted-product qLDPC codes (~30% rate) on reconfigurable neutral atoms. ~10K–26K physical qubits, ~10–264 days at 1ms cycle. Surgery gadgets are existence proofs, decoder-limited, LLM-assisted code search.

Together these bracket Google's own Scenario 1 (fast-clock on-spend) and Scenario 2 (slow-clock at-rest). The Oratomic arch solves Pinnacle's routing problem with atomic reconfigurability rather than non-planar wiring. Hardware gap: 6,100 demonstrated atoms → 10K needed (~2x) vs 1K demonstrated superconducting → 500K needed (~500x).

Neither paper moves Q-Day to next year. Both papers kill the "millions of qubits" comfort model.

Detailed analysis of both:
https://postquantum.com/security-pqc/google-quantum-bitcoin-ecdlp/
https://postquantum.com/security-pqc/10000-qubits-shors/
#infosec #pqc #quantumcomputing #bitcoin #cryptography

Google Quantum AI Achieves 10x Reduction in Resources to Break Bitcoin’s Cryptography

31 Mar 2026 - Google Quantum AI has published a 57-page whitepaper demonstrating that the quantum resources needed to break the elliptic curve cryptography protecting Bitcoin, Ethereum, and virtually every major cryptocurrency are roughly an order of magnitude smaller than previously estimated. The paper, titled 'Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations' and co-authored with researchers from the Ethereum Foundation and Stanford University, presents two optimized quantum circuits for solving the 256-bit Elliptic Curve Discrete Logarithm Problem (ECDLP-256) on the secp256k1 curve — the cryptographic foundation of Bitcoin and Ethereum transaction signatures. The circuits achieve a

PostQuantum - Quantum Computing, Quantum Security, PQC

New breakthrough results for quantum attack resource estimates against 256-bit elliptic curves: most ECC-based applications including ECDSA and Bitcoin could be at risk way sooner than expected:

https://research.google/blog/safeguarding-cryptocurrency-by-disclosing-quantum-vulnerabilities-responsibly/

We estimate that these circuits can be executed on a superconducting qubit CRQC with fewer than 500,000 physical qubits in a few minutes [...] This is an approximately 20-fold reduction in the number of physical qubits required to solve ECDLP-256"

Interestingly, Google and friends did not release the blueprint for the attack circuit. In the name of "responsible disclosure", they only provided a zero-knowledge proof (ZKP) proving that the circuit works. This is, I think , a first in the realm of cryptanalysis disclosure.

The statement that our ZK proof demonstrates is the following: we possess a classical reversible circuit of a specified size which on most inputs correctly computes point addition on the elliptic curve secp256k. This is the primary bottleneck in Shor’s quantum algorithm

I have been saying this since the 2010s: quantum cryptanalysis is one of those non-linear technology progresses that will take everyone by surprise when it arrives. Qubits quality and numbers go up, error-correction and attacks improve, investments scale up accordingly. It's a perfect storm of compound factors. Folks didn't listen, now time is ticking.

More context at: https://gagliardoni.net/#20260331_new_quantum_estimates

#quantum #quantumcomputing #cryptography #security #cybersecurity #infosec #google #bitcoin #blockchain #ethereum #zkp #zeroknowledge

Safeguarding cryptocurrency by disclosing quantum vulnerabilities responsibly

Contextualizing Cryptography

0 comments

Lobsters

Google bumps up Q Day deadline to 2029, far sooner than previously thought

Google is dramatically shortening its readiness deadline for the arrival of Q Day, the point at which existing quantum computers can break public-key cryptography algorithms that secure decades’ worth of secrets belonging to militaries, banks, governments, and nearly every individual on earth

#quantum #quantumcomputing #QDay #encryption #cryptography #PQC #security #cybersecurity

https://arstechnica.com/security/2026/03/google-bumps-up-q-day-estimate-to-2029-far-sooner-than-previously-thought/

Google bumps up Q Day deadline to 2029, far sooner than previously thought

Company warns entire industry to move off RSA and EC more quickly.

Ars Technica
Disclosure of Replay Attack Vulnerability in Signed References

0 comments

Lobsters