But P=NP will not help you crack anything.

IANAC but just what I remember from my CS degree, factorization is NP-complete, if it can be simplified to polynomial then maybe it's easier to crack something (public key systems that rely on the complexity of factorization like RSA) ? Shor's algorithm that works on a quantum computer does make it polynomial and it says in the link that it will have major implications to security schemes that rely on factorization (such as RSA).

I wonder if this movie is related to that (transforming sand to glass could be relevant to how Shor transformed the problem using the quantum Fourier transform)