A First Study of the Neural Network Approach to the RSA Cryptosystem

G.C. Meletiou, D.K. Tasoulis, and M.N. Vrahatis (Greece)


Public Key Cryptography, RSA, Neural Networks


The RSA cryptosystem is considered the first realization of a public key cryptosystem. Its (computational) security relies upon the difficulty of factorization. In order to break the RSA cryptosystem it is sufficient to factorize N where N is the product of two large prime numbers, N = p . q. This is equivalent to calculating φ(N) = (p - 1)(q - 1)where φ is the Euler function. In this paper Neural Networks are trained to compute the function φ.

Important Links:

Go Back