4397328654844826923795068102505872571721883526553349659561256924505973939597593482272505698004801207988043088656411102133523080581 divides RSA-260

all 12 comments

sorted by: hot top controversial new old
[–] 1 point 52 minutes ago

Can someone explain what this means concretely, does that mean you can decrypt stuff that uses? And if yes is there anything in the real world that actually uses it?

  • source
  • [–] 5 points 2 hours ago*

    Does RSA-260 only have one key?

    Edit: > that were part of the RSA Factoring Challenge

    Oh...

  • source
  • [–] 6 points 7 hours ago (1 child)

    Ok cool... But what about the other factor?

    (jk)

  • source
  • hideshow 2 child comments
  • [–] 17 points 12 hours ago (3 children)
  • [–] 70 points 12 hours ago*

    Let's say you have a number like 35. This is the product of two prime numbers, and with a bit of calculation you can figure out that the primes are 5 and 7. Factoring is doing that calculation, and 5 and 7 are called the factors.

    When the number that you start with is large (RSA-260 is 260 decimal digits) factoring is a difficult computational challenge. RSA-260 (and a bunch of other ones of various sizes) were published a few decades ago and someone just managed to factor RSA-260. One of the factors is 439732... (the number in the post body) and that lets you calculate the other one by long division (no big deal when you use a computer). Without reading the report I'm going to guess that factoring RSA-260 took some months on a cluster of fairly fast computers, i.e. a bit much for a random person with a laptop but within reach of government agencies or tech companies.

    Factoring big numbers efficiently is a big important math problem that until recently was the basis of most web security. There is a scheme ("RSA") for using a composite number (like RSA-260) as an encryption key, where decryption requires knowing the factors, which are very hard to find. Typically the numbers encryption keys for web servers were 2048 bits which is around 600 decimal digits, so still out of reach for the methods and hardware that cracked RSA-260. But, for other theoretical reasons, the web has been moving away from the RSA scheme towards one based on elliptic curves (another math thing, don't worry about what it means exactly, it's a more sophisticated version of the same idea).

  • source
  • parent
  • [–] 16 points 12 hours ago* (last edited 12 hours ago) (1 child)

    About 600 bits I think. I'm surprised this one wasn't done sooner. It's about 863 bits per below (260 / log10(2)). I made a miscalculation earlier. Ok this is impressive.

  • source
  • hideshow 2 child comments