Tran Minh Thanh, Vo Hoai Viet · 2026 · arXiv
DOI: 10.48550/arXiv.2610.30935 · open-access PDF
RSA, Diffie-Hellman 및 ECC와 같은 현대 공공 키 암호화 시스템의 보안은 전체 요소 요소화 및 분리된 로고리즘 문제의 컴퓨팅 불가능성에 전적으로 의존합니다. 이러한 비대칭 알고리즘이 작동하려면 핵심 요구 사항은 시스템이 극도로 큰 숫자의 원성을 생성, 테스트, 동시에 증명할 수 있어야한다는 것입니다.
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