Comment Re:Bad idea? (Score 1) 302
A minor point, but it has not been proven that it is computationally infeasible to break midern cryptography. We don't even know if factoring and discrete logarithm, for instance, are NP-complete. (Nor, famously, if P = NP or not.)
