Tran Minh Thanh, Vo Hoai Viet · 2026 · arXiv
DOI: 10.48550/arXiv.2610.30935 · open-access PDF
Keamanan sistem kriptografi kunci publik modern, seperti RSA, Diffie-Hellman, dan ECC, sepenuhnya tergantung pada intractabilitas komputasi dari faktorisasi seluruh dan masalah logaritma terpisah. Untuk algoritma asimetris ini untuk beroperasi, persyaratan inti adalah bahwa sistem harus mampu menghasilkan, menguji, dan secara bersamaan membuktikan keutamaan bilangan yang luar biasa besar. Untuk memenuhi persyaratan tersebut, studi ini mengusulkan kerangka kerja yang komprehensif, menghubungkan teori bilangan kelas dengan model pembelajaran mesin modern dan algoritma optimalisasi.
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