RE: RE: Brute Force Debacle: (P)olynomial vs NP
You are viewing a single comment's thread from:

RE: Brute Force Debacle: (P)olynomial vs NP

Words
67
Reading
1 min
Listen
Play
3y

So I don't know how much of it was theoretical bs, but I was at an engineering conference for some blockchain stuff I whitepaper'd at school. While I was there a guy spoke about how quantum computing would break asymmetric cryptography, but symmetric could be saved with a bunch of extra bits.

If dude was right, that would make asymmetric cryptography = p.

I guess we'll see.

@kryptik: So I don't know | Ecency