Newest papers

Bridging Number-Theoretic Primality Testing And Algorithmic Optimization: An Adaptive Cryptographic Framework

Tran Minh THANH, Vo Hoai Viet · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.30935 · cited by 0 works (OpenAlex) · open-access PDF

Hindi

आधुनिक सार्वजनिक कुंजी क्रिप्टोग्राफी प्रणालियों की सुरक्षा, जैसे आरएसए, डायफी-हेलमैन, और ईसीसी, पूरी तरह से पूर्ण संख्या कारकनिवृत्ति और विशिष्ट लोकारिथ्म समस्याओं की गणनात्मक अविभाज्यता पर निर्भर करती है। इन असम्मित एल्गोरिथ्मों को संचालित करने के लिए, एक कोर आवश्यकता यह है कि सिस्टम को उत्पन्न करने, परीक्षण करने और एक ही समय में असाधारण रूप से बड़े संख्याओं की प्राथमिकता को साबित करने में सक्षम होना चाहिए। इन आवश्यकताओं को पूरा करने के लिए, यह अध्ययन आधुनिक मशीन सीखने के मॉडल और अनुकूलन एल्गोरिथ्म के साथ क्लास-सिलिक संख्या सिद्धांत को पुल करने, एक व्यापक ढा

Machine translation (Meta M2M100); the English original follows.

Abstract

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 paper delineates an adaptive, arbitrary-precision architecture dedicated exclusively to primality testing. Concurrently, the research deeply analyzes the theoretical foundations of testing methods (both deterministic and probabilistic), hardware-level optimization techniques, and the application of quantum-secured entropy sources, while providing rigorous mathematical proofs to guarantee security even when the prime distribution is biased.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Primality test, Cryptography, Computer science, Theoretical computer science, Discrete logarithm, Mathematical proof

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: 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.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange