8 ms·
RSA-260 Factorized
https://lilting.ch/en/articles/rsa-260-factored-how-computed https://lilting.ch/en/articles/rsa-260-factored-how-computed
https://www.scientificamerican.com/article/whats-the-tech-behind-the-record-breaking-rsa-260-crack/ https://www.scientificamerican.com/article/whats-the-tech-be...
https://en.wikipedia.org/wiki/RSA_numbers#RSA-260 https://en.wikipedia.org/wiki/RSA_numbers#RSA-260
- samyok 24d agoanddd it's already on wikipedia https://en.wikipedia.org/wiki/RSA_numbers#RSA-260 https://en.wikipedia.org/wiki/RSA_numbers#RSA-260
- rho4 22d agoThat list ordering drives me nuts. What's up with 1024?! And how come much larger numbers have already been solved? Based on that information one cannot strictly assume that the current solution required improvements to the strategy or hardware, no?
- rcxdude 22d agoThe ordering is stupid because some of them are named by the number of bits and some of them are named by the number of decimal digits. They are in order of size and this is the largest one so far, despite the confusing names.
- dclavijo 24d agoWhat was the methodology,software, hardware, cpu cores, time taken?
- internet2000 23d ago[flagged]
- adastra22 23d agoIt wasn’t. The person that posted the factorization has nothing to do with Anthropic, and has for many years held the leaderboard on GPU-hours applied to factorization and prime search problems. He’s not yet on record as to how this one was done (probably waiting for publication), but there is no reason at all to assume any LLM was involved.
- tyre 22d agoI heard it was a lucky guess
- bawolff 22d agoSeems unlikely given claude would not really be effective for this type of problem.
- charcircuit 22d agoWhy not? Claude has already shown it can automate mathematics and it can automate programming and running programs (including renting the servers).
- hnaccount_rng 22d agoBecause there is nothing not already automated here. RSA will either be cracked because some assumption about prime numbers doesn’t hold or because we throw more and more brute force on it. And if it were the former it wouldn’t be the “next” in line that would be cracked…
- charcircuit 22d agoYou don't have to have RSA be broken in order to get a competitive advantage over other people searching. You just need Claud to find software optimization that got overlooked or something from number theory to come up with better candidates to guess.
- 22d ago
- madars 24d ago"4397328654844826923795068102505872571721883526553349659561256924505973939597593482272505698004801207988043088656411102133523080581 divides RSA-260" Background: https://en.wikipedia.org/wiki/RSA_Factoring_Challenge https://en.wikipedia.org/wiki/RSA_Factoring_Challenge
- nk_kolja 24d agoImpressive. I wonder the methodology. Algorithmic improvements? More probably just an implementational optimisation. Last RSA record was due to special q sieving methods if I recall well, some 3k core hours. I hope there’s a theoretical improvement behind the result.
- aaron695 23d ago[dead]
- learningstud 22d agoThe general public is gradually catching up with NSA it seems...
- nk_kolja 23d agoSo RSA 260 is about 2-3 times harder than RSA 250, which was solved in 2700 core hours in 2020, so it’s probably no algorithmic improvements, just a tweak here and there plus faster hardware.
- mswphd 23d agofaster hardware could also mean gpu/asic/etc.
- ni5arga 22d agoI'm assuming it is still GNFS but GPU backed. For reference, check this out: > cuda-sieve is an experimental, standalone CUDA implementation of the lattice-sieving relation-collection pipeline used by the Number Field Sieve. It builds factor bases, sieves both sides of a special-q lattice, performs trial division and GPU cofactorisation, and emits relations for msieve. https://github.com/kyleaskine/cuda-sieve https://github.com/kyleaskine/cuda-sieve
- alexfoo 23d ago2700 core years
- ajross 23d agoIt's sort of fun to remember the genuine worry in the community around RSA and the (really, really shocking at the time!) progress in factorization leading up to GNFS techniques. Like, it really looked like everything was going to fall apart. We all rushed to 1024 bit keys, and then to 2048 bit after what felt like a few months. And... maybe even that wouldn't be enough? And actual history ended up being the boring version: it was absolutely enough, factorization is seemingly settled math at this point, no new techniques have been discovered. At the end of the day RSA was just fine and no one really needed to bother with ECC and all of its confusing tutorials. And the ~23 year old 1024 bit key holding my GnuPG box closed is still just fine, cryptographically. (Though the chances of getting hit with a keylogger or other side channel attack over that period are nontrivially high and I suppose I really should rotate it or something).
- mikestorrent 23d agoYou can just send the gnupg box and keys to me, I will hold them securely for you so you don't have to worry about it
- deleted 23d ago[deleted]
- layer8 23d agoECC does have the benefit of smaller keys, but yes, RSA seems fine security-wise for the foreseeable future.
- adastra22 22d agoRSA-1024 absolutely is not.
- pseudohadamard 22d agoWhy not? What's the actual threat? Let's say I'm using RSA-1024 on my firewall today. What happens next?
- drfuchs 23d agoCan I decode my DVD collection now?
- layer8 23d agoDVD encryption doesn’t use RSA; and yes, you could since late 1999 already.
- charcircuit 22d agoNot in the US due to DMCA as the encryption is a protection measure.
- ni5arga 22d agoI don't think DVDs use RSA.
- frays 22d agoWhich will come first? AGI or breaking RSA-1024
- doubletwoyou 22d agoI’ll bet breaking RSA-1024 at this rate