DeepMind uses AlphaProof Code to formally verify Signal's protocol
Gemini Carbon agents produced over six million lines of Lean in four weeks and flagged two reintroduced bugs.
174 stories, newest first · one card per story
Gemini Carbon agents produced over six million lines of Lean in four weeks and flagged two reintroduced bugs.
Repeated doFinalize calls without new input return the same bytes, so the documented KDF example derives identical keys.
On 192 threads it restores 1 to 9 levels for 4096 messages in 46 to 83.4 ms, up to 3 times faster than SHIP.
For large n and prime p greater than n, resilience holds whenever t/n is at least 0.489.

A sandboxed rerun forged signatures in 391 core-years versus 1,380 previously; DeepMind says 2048-bit keys stay secure.
For two servers, query time is n^0.82, matching prior EUROCRYPT 2026 schemes with far less storage.
A three-record parity filter cuts the leading independent-bit error term from e to e squared before reconciliation.
The construction is secure against polynomial-size adversaries under two average-case conjectures and answers a STOC 2010 question.
In samples, about seven in ten commits and two in three issues were labeled post-quantum related.
The constructions are CCZ-inequivalent to listed APN monomial and Ness-Helleseth binomial families for q greater than 7.

A quantum attacker could forge today’s Privacy Pass tokens, while token privacy is described as holding even after Q-day.
New explicit construction works for min-entropy k=polylog(n) on quadratic sources, bypassing the sumset extractor barrier for 2-local sources.

FlashProve uses zkSNARKs to prove model authorship without exposing weights, limited to 1024 token contexts.
The note gives a post-quantum security proof for multi-output interactive hashing with arbitrary relations.
The paper proves 2QKE is equivalent to efficiently-verifiable state puzzles and quantum signatures, potentially weaker than one-way functions.
New lower bounds show random oracle cannot reduce online communication in information-theoretic MPC and that quantum-accessible oracles with classical communication yield no savings.
Explicit G_c permutation over Galois rings achieves uniform differential uniformity bound of 36 independent of m.
One CPU core solves arbitrary 19-step padded targets in median 19.5 seconds.
Poly is faster than Polyval for n=256 and 512 while Polyval is faster for n=128 in optimized implementations for NIST cryptographic accordions.
A 256-bit digest, 32 pairs, and length 65535 yield 254 records plus a renewal certificate.

NISTIR 8547 sets federal high-value key-establishment work for 2030 and signatures for 2031, with a 2035 overall target.

The standalone product inventories certificates, TLS, keys and code, then opens ServiceNow tickets for remediation.

US high-value systems must move key establishment by 2030 and digital signatures by 2031; the broader federal target is 2035.

High-value assets must use PQC for key establishment by December 31, 2030, and for signatures by December 31, 2031.
Today 1.5K readers · 2.4K views · 753 reads · all time 189K views