Decryption of Factorization - Cryptography Challenges

2024

Full text Open access: Green Metadata (CSL-JSON)
DOI 10.20944/preprints202404.0125.v1
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

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.