No but the second star problem gives an idea of the algorithmic complexity of actual problems (notably security problems, here it gives an idea about how and why the RSA algorithm works, this probelm being equivalent to finding a decomposition of a ~10 bits as a product of prime numbers; actual RSA keys are now based on at least 128 bit keys but most secure apps now use 1024 bit keys, where not only brute basic force attacks are not possible but also smart attacks using arthmetic properties is also computingly intensive).
I bet the other problems are the same kind: they allow people experiment with encryption/security algorithms that are based on combinatorially difficult problems that are not soluble easily given the current limits of today's computers in terms of memory space available, number of available computing units that can run in parallel, and energy needed to make all this run... unless these resources are stolen, but even in that case there's a limit as there's not an infinity of devices you can steal to do that work as this is currently caped to about 36 bits today, still very far of the current 1024 limits of RSA).
