Announcing: Slashdot Deals - Explore geek apps, games, gadgets and more. (what is this?)

Thank you!

We are sorry to see you leave - Beta is different and we value the time you took to try it out. Before you decide to go, please take a look at some value-adds for Beta and learn more about it. Thank you for reading Slashdot, and for making the site better!



Crypto Snake Oil

Atrus5 Re:Crypto is scary stuff (215 comments)

On the topic of complexity classes ... Currently, the decision problem form of factorization is known to be in NP, co-NP, and BQP. Because it's within NP, it can not be NP-hard without being NP-complete. If it were shown to be NP-complete or co-NP-complete, that would imply that NP = co-NP, which is currently believed to to be false.

BQP is "bounded-error, quantum, polynomial" and represents what quantum computers are capable of. It is known to contain P and BPP, and to lie within PP and PSPACE.

Your claim that quantum computers should be able to solve NP-hard problems (presumably in polynomial time) doesn't make sense ...

I believe that your formulation of the problem, "any public key cryptosystem", makes it impossible to prove anything. I think you should at least make a list of problems that are currently used as the basis of various public key systems and start hacking at them ...

I'm sorry, but your post borders on incoherent, so it's difficult to comment on more of it.

more than 8 years ago


Atrus5 hasn't submitted any stories.


Atrus5 has no journal entries.

Slashdot Login

Need an Account?

Forgot your password?