Studying the performance of artificial neural networks on problems related to cryptography

Cryptosystems rely on the assumption that a number of mathematical problems are computationally intractable, in the sense that they cannot be solved in polynomial time. Numerous approaches have been applied to address these problems. In this paper, we consider artificial neural networks and study their performance on approximation problems related to cryptography.