/
Navigation
Chronicles
Browse all articles
Explore
Semantic exploration
Research
Entity momentum
Nexus
Correlations & relationships
Story Arc
Topic evolution
Drift Map
Semantic trajectory animation
Posts
Analysis & commentary
Pulse API
Tech news intelligence API
Browse
Entities
Companies, people, products, technologies
Domains
Browse by publication source
Handles
Browse by social media handle
Detection
Concept Search
Semantic similarity search
High Impact Stories
Top coverage by position
Sentiment Analysis
Positive/negative coverage
Anomaly Detection
Unusual coverage patterns
Analysis
Rivalry Report
Compare two entities head-to-head
Semantic Pivots
Narrative discontinuities
Crisis Response
Event recovery patterns
Connected
Search: /
Command: ⌘K
Embeddings: large
TEXXR

Chronicles

The story behind the story

days · browse · Enter similar · o open

Researchers achieve new cryptography milestones, including factoring the largest RSA key size ever, largely thanks to improved algorithms, not better hardware

795-bit factoring and discrete logarithms achieved using more efficient algorithms.  —  34 with 24 posters participating Tweets: @nholzschuch , @dangoodin001 , and @arstechnica Tweets: Nicolas Holzschuch / @nholzschuch : With an actual e-mail from Emmanuel Thomé, and complete affiliation of all authors, @arstechnica does a pretty good job at explaining this one. https://twitter.com/... Dan Goodin / @dangoodin001 : Better mousetrap—not Moore's Law—plays lead role in new crypto-cracking record https://arstechnica.com/... @arstechnica : Researchers have reached a new milestone in the annals of cryptography with the factoring of the largest RSA key size ever computed and a matching computation of the largest-ever integer discrete logarithm. https://arstechnica.com/...

Ars Technica Dan Goodin

Context & Ripple Effects

The 795-bit factoring record matters because of how it was set: the researchers behind it, whose work Ars Technica's Diffie–Hellman Turing Award lineage of number-theoretic cryptography builds on, attribute the milestone to more efficient algorithms rather than more computing power. That inverts the usual assumption that crypto-cracking progress tracks hardware curves.

The record lands mid-arc for RSA itself: the same ecosystem already absorbed a flaw in a widely used RSA code library that undermined millions of high-security keys, and the field is simultaneously racing toward replacements designed for a quantum era. Algorithmic wins like this one tighten estimates of how long classical public-key methods stay safe.

First-order effects

  • Operators relying on RSA must treat published key-size safety margins as shakier than hardware-based forecasts suggested, since algorithmic gains can move the cracking frontier without any new machines being bought.

Second-order effects

Third-order effects

  • If algorithmic efficiency keeps outpacing Moore's Law as the driver of crypto-breaking records, the industry's planning assumption shifts from 'wait for quantum hardware' to continuous primitive rotation — a posture US agencies have already begun adopting against attackers who harvest data now for later decryption. Quantum estimates remain contested: a researcher's claim that factoring 2048-bit RSA could take roughly 20x fewer noisy qubits than previously estimated still sits far beyond current machines, and skepticism greeted Chinese researchers' claimed quantum break of RSA.

The trend: Cryptographic breaking-points are increasingly set by algorithmic breakthroughs rather than hardware scaling, accelerating the migration away from classical public-key systems like RSA.

Discussion

  • @nholzschuch Nicolas Holzschuch on x
    With an actual e-mail from Emmanuel Thomé, and complete affiliation of all authors, @arstechnica does a pretty good job at explaining this one. https://twitter.com/...
  • @dangoodin001 Dan Goodin on x
    Better mousetrap—not Moore's Law—plays lead role in new crypto-cracking record https://arstechnica.com/...
  • @arstechnica @arstechnica on x
    Researchers have reached a new milestone in the annals of cryptography with the factoring of the largest RSA key size ever computed and a matching computation of the largest-ever integer discrete logarithm. https://arstechnica.com/...