126
There's a new way to break RSA that's faster than anything we've seen before (arstechnica.com)
submitted 1 month ago by to c/technology@lemmy.world
54 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[–] -2 points 1 month ago (1 child)

If you want to be pedantic, fine. Integer factoring is not in P. Therefore the math used to encrypt RSA is not in P. The usage of integer factoring to encrypt therefore means it can't be decrypted in P using brute force. That's the point I'm making.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 1 child comment
    •
  • [–] 5 points 1 month ago

    We actually don't know if integer factorization is not in P, though.

    Right now, I think most of us would guess that it is a prime candidate for NP Intermediate. Hence why I mentioned it earlier.

    And you absolutely can solve it in polynomial time just not with classical architectures.

  • permalink
  • fedilink
  • source
  • parent