If a cryptographic algorithm succeed all the 15 NIST randomness tests, can we say that algorithm has more chance to resist against cryptanalytic attacks
It is easy to construct an algorithm that passes all NIST test however it is really easy to crack. For example see my article how to hide a backdoor to a PRNG that passes all NIST statistical tests, but really easy to predict only observing a few hundred bits: https://akjournals.com/view/journals/012/52/2/article-
p233.xml
When you are testing a cryptographic algorithms it is very important to pass the NIST test. Passing NIST test is a necessary but not sufficient condition. The NIST test is the first step. If your algorithm passed the NIST test you can start the actual analysis of the algorithm.