return2ozma@lemmy.world to Technology@lemmy.worldEnglish · 2 months agoThere's a new way to break RSA that's faster than anything we've seen beforearstechnica.comexternal-linkmessage-square45linkfedilinkarrow-up1137arrow-down18
arrow-up1129arrow-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 · 2 months agomessage-square45linkfedilink
minus-squarea_non_monotonic_function@lemmy.worldlinkfedilinkEnglisharrow-up5·2 months agoWe 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.
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.