View Single Post
  #2  
Old 09-08-2026, 14:10
chants chants is offline
VIP
 
Join Date: Jul 2016
Posts: 876
Rept. Given: 48
Rept. Rcvd 53 Times in 32 Posts
Thanks Given: 755
Thanks Rcvd at 1,171 Times in 542 Posts
chants Reputation: 53
Since you dont realize it, factoring RSA512 with a general number field sieve GNFS or even a quadratic sieve is not particularly challenging and a good library implementing those or even an LLM can do this very trivially. So its cool but not impressive. Factoring a modulus more than 862 bits is another story.
Reply With Quote