Integer Prime Factorization with Deep Learning
Abstract
Prime factor decomposition is a method that is used in number theory and in cryptography, as well. The security of the message depends on the difficulty of factorization. In other words, to hack the RSA system, factorization of N is needed, where N is a product of two prime (generally large) numbers. This paper analyzes the approaches which are already used to solve the problem, and proposes a new method which is expected to increase the efficiency of prime number factorization with the help of neural networks. The results in this paper can be used to develop and improve the security of cryptosystems.Copyright
Articles submitted to the journal should not have been published before in their current or substantially similar form, or be under consideration for publication with another journal. Please see Emerald's originality guidelines for details. Use this in conjunction with the points below about references, before submission i.e. always attribute clearly using either indented text or quote marks as well as making use of the preferred Harvard style of formatting. Authors submitting articles for publication warrant that the work is not an infringement of any existing copyright and will indemnify the publisher against any breach of such warranty. For ease of dissemination and to ensure proper policing of use, papers and contributions become the legal copyright of the publisher unless otherwise agreed.
The editor may make use of iThenticate software for checking the originality of submissions received. Please see our press release for further details.
