Tran Minh Thanh, Vo Hoai Viet · 2026 · arXiv
DOI: 10.48550/arXiv.2610.30935 · open-access PDF
La seguridad de los modernos sistemas criptográficos de clave pública, como RSA, Diffie-Hellman y ECC, depende totalmente de la intractabilidad computacional de la factorización de números enteros y de los problemas de logaritmos discretos. Para que funcionen estos algoritmos asimétricos, un requisito fundamental es que el sistema debe ser capaz de generar, probar y demostrar simultáneamente la primacía de números extraordinariamente grandes.
Machine translation (Meta M2M100); the English original follows.
The security of modern public-key cryptographic systems, such as RSA, Diffie-Hellman, and ECC, depends entirely on the computational intractability of the integer factorization and discrete logarithm problems. For these asymmetric algorithms to operate, a core requirement is that the system must be capable of generating, testing, and simultaneously proving the primality of extraordinarily large numbers. To meet those requirements, this study proposes a comprehensive framework, bridging clas- sical number theory with modern machine learning models and optimization algorithms. Specifically, the
Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese
GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.30935, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txtSources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange