GPT-6 Astra autonomously broke a previously unsolved Enigma message from WWII by developing its own cryptanalysis software and identifying a repeated phrase as a crib for attack. The breakthrough sparked similar successes, with Claude Opus 5 subsequently breaking another long-encrypted message using the same approach.

• GPT-6 Astra independently selected message Nr. 172 (MVUEH) as the most promising target, then built Python and C++ Enigma simulators and a Bombe implementation to crack it
• The AI identified "ROSENOW ROSENOW" as a repeated plaintext fragment and used it as a known-plaintext attack vector to recover the key
• Claude Opus 5 followed up by breaking message Nr. 205 using a signature phrase (XHARTJENSTEINX) as the crib, showing the technique's reproducibility

This article debunks the idea that quantum computers halve the security of symmetric keys via Grover’s algorithm, showing that the required depth and parallelization make an AES-128 key search infeasible. Concrete gate-count estimates and NIST’s MAXDEPTH guidelines confirm that AES-128 (and larger keys) remain secure against practical quantum attacks.

• Grover's algorithm can't be parallelized without losing its quadratic speedup, so splitting the key search across many quantum processors just increases total work rather than reducing time needed.
• Cracking AES-128 in 10 years would require ~1.4×10^14 parallel circuits of 724 qubits each with a circuit depth around 2^64 — far beyond any feasible quantum hardware.
• Breaking 256-bit ECC via Shor's algorithm would be about 4.3×10^23 times faster than breaking AES-128 via Grover's, showing symmetric keys aren't the weak link.
• NIST's post-quantum standards (Category 13, MAXDEPTH limits, IR 8547 roadmap) keep all AES key sizes approved without requiring a move to 256-bit symmetric keys.

Google’s recent paper reveals that Shor’s algorithm can potentially break the cryptography used by Bitcoin and Ethereum with fewer than 500,000 qubits. The paper discloses significant architectural details, suggesting that reproducing similar circuits is feasible for well-resourced quantum research teams. However, the actual hardware needed for an attack remains a substantial barrier.

• Google's paper shows Shor's algorithm could break Bitcoin/Ethereum's 256-bit ECC with under 500,000 physical qubits in about nine minutes—roughly Bitcoin's block time.
• Even though Google withheld exact circuit details, the disclosed architecture (kickmix design, modular inversion, ~2.7 million non-Clifford gates per point addition) gives skilled teams enough to replicate similar circuits within months.
• Goertzel estimates a small expert team could reproduce circuits within 2-3x Google's efficiency in 6-12 months, and even a 2x-worse circuit would still threaten current cryptography.
• The real barrier isn't algorithmic knowledge but building the actual hardware, though well-funded labs or defense contractors could plausibly pursue it.