Skip to content

Comment on RSA-260 Factorizedparent

Comments

So 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.

2700 core years

Of course years. Typo.

faster hardware could also mean gpu/asic/etc.

I'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

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.