Paper proposes adaptive primality testing for public-key cryptography
Original title: Bridging Number-Theoretic Primality Testing And Algorithmic Optimization: An Adaptive Cryptographic Framework
The architecture targets prime generation for RSA, Diffie-Hellman, and ECC, including proofs when prime distributions are biased.
A cs.CR paper proposes an adaptive arbitrary-precision framework for generating and testing very large primes used by public-key systems. It combines classical number theory with machine-learning models and optimization algorithms. The work reviews deterministic and probabilistic tests, hardware optimizations, and quantum-secured entropy, and offers proofs intended to hold even if the prime distribution is biased.
- Security assumptions cited are integer factorization and the discrete logarithm problem.
- The framework is limited to primality testing rather than a full cryptosystem.
- Both deterministic and probabilistic testing methods are analyzed.
From the original article
1 min read at arxiv.orgThe 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.
By Tran Minh Thanh · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.