Large semiprimes created to challenge prime factorization research and computational number theory.
Why it's trending
via Google SearchRSA numbers, large semiprimes for factorization research, are trending after Eric Lu factored the 260-digit RSA-260—unfactored for 35 years—setting a world record.
More on why it's trending
Eric Lu announced the factorization of RSA-260, a 260-digit number that had stood unfactored for 35 years, setting a new world record for the largest general-purpose number factorization. The achievement sent curious readers to the Wikipedia article on RSA numbers to understand what these challenge numbers actually are.
Sources
- johndcook.comNew RSA number factored
Eric Lu announced on X today that he has factored RSA-260, a number N with 260 digits (862 bits) that is the product of two large primes [1].
- reddit.comRSA-260 factored : r/math
The first RSA numbers generated, from RSA-100 to RSA-500, The value is the multiplication of two large prime numbers. RSA sets out an algorithym for securely ...
- linkedin.comCraig A. Linton's Post
RSA-260 is a "challenge number," not an encryption algorithm or key standard. RSA-240 and RSA-250, were solved in 2019 and 2020, respectively. RSA-260 is a 260 ...
- explainx.aiRSA-260 Factored: Verify It Yourself in 3 Lines (2026)
RSA-260 is a 260-decimal-digit, factoring difficulty. It had stood unfactored for 35 years. RSA-250, fell in February 2020.
- x.comSilas Alberti on X
This sets the world record for the largest general-purpose number factorization. The next-smallest number RSA-250 was factored in 2020.
- tech.yahoo.comWhat's the tech behind the record-breaking RSA-260 crack?
The three co-founded a company named RSA Security, and in 1991 it published a list of "RSA numbers," each formed by multiplying larger and larger secret primes.
- facebook.comOn Thursday technical researcher Eric Lu sparked ...
RSA-260”—a number used for RSA, one of the world's most popular encryption schemes … number 2,269,753, which has 22 bits. However, modern RSA keys are much ...
- shattered.ioECC vs RSA: 25x Faster Signing, Smaller Keys [2026]
This piece breaks down what actually separates RSA from elliptic curve cryptography (ECC) in 2026: the math, the speed, the adoption numbers, the pricing, and ...
- docs.espressif.comRsaMultiplication in esp_hal::rsa - Rust
Support for RSA peripheral's large number multiplication feature that could be used to find the `operand a * operand b`.