return2ozma@lemmy.world to Technology@lemmy.worldEnglish · 1 month agoThere's a new way to break RSA that's faster than anything we've seen beforearstechnica.comexternal-linkmessage-square54linkfedilinkarrow-up1136arrow-down17
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 · 1 month agomessage-square54linkfedilink
minus-squarea_non_monotonic_function@lemmy.worldlinkfedilinkEnglisharrow-up5·1 month 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.