return2ozma@lemmy.world to Technology@lemmy.worldEnglish · 13 天前There's a new way to break RSA that's faster than anything we've seen beforearstechnica.comexternal-linkmessage-square54linkfedilinkarrow-up1136arrow-down18cross-posted to: security@programming.devcybersecurity@sh.itjust.workscybersec@fed.dyne.orgcybersecurity@infosec.pubcrypto@infosec.pub
arrow-up1128arrow-down1external-linkThere's a new way to break RSA that's faster than anything we've seen beforearstechnica.comreturn2ozma@lemmy.world to Technology@lemmy.worldEnglish · 13 天前message-square54linkfedilinkcross-posted to: security@programming.devcybersecurity@sh.itjust.workscybersec@fed.dyne.orgcybersecurity@infosec.pubcrypto@infosec.pub
minus-squarerockSlayer@lemmy.blahaj.zonelinkfedilinkEnglisharrow-up1arrow-down3·13 天前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.
minus-squarea_non_monotonic_function@lemmy.worldlinkfedilinkEnglisharrow-up5·13 天前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.
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.
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.