Encryption, Post Quantum Cryptography, Optical Computing, Cryptography.
and secure. If you do find the key (or have it already), you can still verify that you have been successful by undoing the encryption in polynomial time. The large-prime factoring problem is an NP problem, in that it takes much longer to find a solution than it does to verify it and is therefore