News for hackers. Stuff that matters.
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by socketpuppet on Wednesday January 19, 2011 @07:11PM (#2121912)
How so?

1) One time pads are provably secure albeit impractical

2) Integer factorization is BQP, but not necessarily NP-complete.

Re:The polynomial algorithm for 3-SAT problem (or P=NP) by ot on Wednesday January 19, 2011 @07:31PM (#2121960)
1) One time pads require a secure channel to transmit the key, which must be the same length of the message. It is not a feasible cryptography scheme, more of a theoretical framework.

2) Integer factorization is trivially in NP (the decision problem "n has a factor < x" has a certificate: the factor)

Re:The polynomial algorithm for 3-SAT problem (or P=NP) by jbri on Wednesday January 19, 2011 @07:41PM (#2121995)
A quantum channel provides protection against eavesdropping for random data, but does not provide security for specific data. A shared quantum channel can be used to easily produce a shared one-time key that only the two parties involved know, which can then be used to encrypt specific data over an unsecured channel.
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by smallblacksun on Wednesday January 19, 2011 @08:53PM (#2122216)
One time pads are not useful in many cases, but they have been used:

http://en.wikipedia.org/wiki/One-time_pad#Historical_uses