Click any tag below to further narrow down your results
Links
Google DeepMind used a multi-agent AI system called AlphaProof Code to mathematically prove security properties of the actual compiled code behind Signal's encryption protocol, a task that usually takes expert teams years. The whole verification took four weeks, with humans reviewing only about one percent of the generated proofs.
- Formal proofs were generated for the real Signal implementation, not just its design, covering over six million lines of Lean code.
- The system was tested by reintroducing two previously fixed bugs, and in both cases it produced a machine-checked proof that the buggy version was insecure.
- Human experts only needed to review about one percent of the codebase, since Lean automatically checks the rest.
Anthropic's red team reports that an internal Claude model traced the origins of the NIST elliptic curve seeds to the lrand48 random number generator seeded with a Unix timestamp, ending a decades-long question about whether the curves were backdoored. The team says the finding shows the curves were generated in a simple, reproducible way.
- The NIST P-192, P-224, P-256, P-384, and P-521 seeds are outputs of the C library's lrand48 generator seeded by Unix timestamps from 1997 to 1998, not a hash of a humorous passphrase as rumored.
- Claude recovered the generator state by spotting a pattern of zero top bits in the seeds, then solving a truncated linear congruential generator using lattice reduction (LLL).
- Some base points, including those of the ANSI X9.62 curves, trace to the FreeLIP and NTL random number generators, but the base points for P-224, P-256, P-384, P-521, and the NIST binary curves remain unexplained, as does the B-163 seed.
Cryptographers from Stanford and a16z address whether recent AI breakthroughs threaten the math underpinning encryption. The short answer: recent AI progress on general math problems tells us almost nothing about cryptographic security, and even smarter AI can't solve problems that don't have efficient solutions.
- Recent AI math breakthroughs didn't include any cryptography results, so they reveal nothing about whether encryption methods are actually vulnerable.
- Modern cryptography assumes certain math problems have no efficient algorithm at all—not just that humans haven't found one yet. A smarter AI can't discover an algorithm that doesn't exist.
- AI could compress the years-long vetting process for new cryptographic systems by rapidly testing whether they can be broken, building confidence faster than traditional analysis.
- Cryptographic agility—the ability to switch between different encryption methods—already exists in systems like TLS and offers defense against both AI and quantum threats.
The Internet's DNS system is replacing its root key-signing key for only the second time on October 11, 2026. Most sites need no action, but validating resolvers must trust the new key beforehand or websites could become unreachable for their users.
- KSK-2024 (key tag 38696) will replace KSK-2017 as the signer of the root's DNSKEY set. Resolvers that don't trust the new key before the switch could make all websites unreachable under any top-level domain for their users.
- The new key has been published since January 2025 to give resolvers time to discover it automatically via RFC 5011, but Cloudflare added it to their resolver software's built-in trust anchors in July 2024 after learning from 2018 rollover failures where upgrades and machine moves caused resolvers to lose learned keys.
- RFC 8509 now lets you test whether your resolver trusts KSK-2024 using a readiness test tool that queries sentinel domains—this capability didn't exist for the 2018 rollover.
- The rollover continues into 2027 when ICANN plans to revoke KSK-2017 and delete its private key. A future algorithm change to ECDSA is planned separately.
As AI agents handle sensitive personal data across different networks, they'll need ways to cooperate on shared problems without exposing that information. This piece walks through cryptographic techniques like secure multiparty computation and homomorphic encryption that let agents answer narrow questions together before deciding whether to share more.
- Agents can use MPC and FHE to check mutual interest (free calendar slots, matching errors, salary ranges) by computing on encrypted or secret-shared data, revealing only yes/no answers rather than raw information.
- A hybrid approach combines MPC and FHE so agents create a shared encryption key while keeping secret key shares, preventing even the computing server from decrypting results without both parties' consent.
- At scale, millions of agents paying for private computations could generate thousands of payments per second, making fast stablecoin networks and state channels economically viable for settling these micro-transactions.
This article traces how blockchain didn't emerge from nowhere but instead synthesized decades of work across distributed systems, cryptography, and economics. a16z crypto assembled interviews with Turing Award winners and Nobel laureates—including Leslie Lamport, Barbara Liskov, Ron Rivest, and others—who explain how their foundational research on Byzantine fault tolerance, consensus algorithms, cryptography, and market design eventually became core components of blockchain systems.
- Blockchain's core components (Byzantine fault tolerance, consensus, public-key crypto, zero-knowledge proofs, auction/market design) were all developed decades earlier for unrelated problems, then repurposed.
- Lamport's algorithm was debugged by an editor, which pushed him toward rigorous proofs for concurrent systems.
- Noam Nisan built theoretical tools he was certain had no practical use, only to see them become central to blockchain scaling years later.
- Goldwasser argues understanding the narrative of a problem has to come before the math in cryptography research.
Information theory is a mathematical framework for quantifying, storing, and communicating information, established by Claude Shannon in the 1940s. It involves concepts such as entropy, mutual information, and channel capacity, with applications ranging from data compression to cryptography and artificial intelligence. The field combines insights from various disciplines including mathematics, engineering, and computer science.
- Shannon's 1948 work founded information theory by formalizing entropy as a measure of uncertainty/information content
- Channel capacity defines the theoretical maximum rate for reliable data transmission over a noisy channel
- The framework underpins practical technologies like data compression and error-correcting codes, extending into cryptography and AI