4 ms·
Impressive. I wonder the methodology. Algorithmic improvements? More probably just an implementational optimisation. Last RSA record was due to special q sievin
by nk_kolja 1mo ago
Impressive. 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 1mo ago[dead]
- learningstud 1mo agoThe general public is gradually catching up with NSA it seems...
- nk_kolja 1mo 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 1mo agofaster hardware could also mean gpu/asic/etc.
- ni5arga 1mo 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 1mo ago2700 core years
- nk_kolja 1mo agoOf course years. Typo.
- deleted 1mo ago[deleted]