Integer Prime Factorization with Deep Learning
| dc.contributor.author | Murat B. | |
| dc.contributor.author | Kadyrov Sh. | |
| dc.contributor.author | Tabarek R. | |
| dc.date.accessioned | 2025-08-18T06:23:06Z | |
| dc.date.available | 2025-08-18T06:23:06Z | |
| dc.date.issued | 2021 | |
| dc.description.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. | |
| dc.identifier.citation | Murat B , Kadyrov Sh ,Tabarek R./ Integer Prime Factorization with Deep Learning / Vol 2 No 1 (2021): Advances in Interdisciplinary Sciences / 2021 | |
| dc.identifier.isbn | 978-981-16-0036-4 | |
| dc.identifier.uri | https://repository.sdu.edu.kz/handle/123456789/1890 | |
| dc.language.iso | en | |
| dc.publisher | Vol 2 No 1 (2021): Advances in Interdisciplinary Sciences | |
| dc.subject | neural network | |
| dc.subject | prime factorization | |
| dc.subject | binary expansion | |
| dc.title | Integer Prime Factorization with Deep Learning | |
| dc.type | Article |