Article
Version 2
Preserved in Portico This version is not peer-reviewed
Cracking Factorization- Cryptography Challenges
Version 1
: Received: 31 March 2024 / Approved: 1 April 2024 / Online: 2 April 2024 (10:34:13 CEST)
Version 2 : Received: 2 April 2024 / Approved: 2 April 2024 / Online: 3 April 2024 (11:20:37 CEST)
Version 3 : Received: 4 April 2024 / Approved: 4 April 2024 / Online: 5 April 2024 (09:09:38 CEST)
Version 4 : Received: 6 April 2024 / Approved: 8 April 2024 / Online: 8 April 2024 (14:56:14 CEST)
Version 5 : Received: 8 April 2024 / Approved: 10 April 2024 / Online: 10 April 2024 (15:49:24 CEST)
Version 2 : Received: 2 April 2024 / Approved: 2 April 2024 / Online: 3 April 2024 (11:20:37 CEST)
Version 3 : Received: 4 April 2024 / Approved: 4 April 2024 / Online: 5 April 2024 (09:09:38 CEST)
Version 4 : Received: 6 April 2024 / Approved: 8 April 2024 / Online: 8 April 2024 (14:56:14 CEST)
Version 5 : Received: 8 April 2024 / Approved: 10 April 2024 / Online: 10 April 2024 (15:49:24 CEST)
How to cite: Durmagambetov, A.; Durmagambetov, A. Cracking Factorization- Cryptography Challenges. Preprints 2024, 2024040125. https://doi.org/10.20944/preprints202404.0125.v2 Durmagambetov, A.; Durmagambetov, A. Cracking Factorization- Cryptography Challenges. Preprints 2024, 2024040125. https://doi.org/10.20944/preprints202404.0125.v2
Abstract
This article presents a description of a new method for solving the factorization problem, based on the gradient descent algorithm. This approach demonstrates significant improvements in efficiency compared to traditional methods proposed in previous research. This article describes a new method for solving the factorization problem, based on the gradient descent algorithm, and demonstrates the transition from algebraic methods to approaches based on functional analysis. The proposed approach not only improves the efficiency of solving the problem but also allows the application of computational algorithms of functional analysis, opening new possibilities for research and optimization.
Keywords
Decryption; factorization problem; gradient descent algorithm; new method for solving; transition from algebraic methods to approaches based on functional analysis
Subject
Computer Science and Mathematics, Security Systems
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment