The synchronization process of two mutually delayed coupled deterministic chaotic maps is demonstrated both analytically and numerically. The synchronization is preserved when the mutually transmitted signals are concealed by two commutative private filters, a convolution of the truncated time-delayed output signals or some powers of the delayed output signals. The task of a passive attacker is mapped onto Hilbert’s tenth problem, solving a set of nonlinear Diophantine equations, which was proven to be in the class of NP-complete problems (problems that are both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP problem can be translated into this problem)). This bridge between nonlinear dynamics and NP-complete problems opens a horizon for new types of secure public-channel protocols.