Results 1 to 10 of about 583 (221)
SIAM Journal on Computing, 1982 Whether an odd number m is prime can be decided on the knowledge of the image of the function $a \mapsto a^{(m - 1)/2} (m)$. As a consequence, an algorithm for testing primality is proposed (under the extended Riemann hypothesis) which is more efficient than ones proposed by Miller [Pros. 7th ACM Symp. Theory of Computing, 1975, pp.
James Finn, Karl J. Lieberherr
core +18 more sources
Recent Breakthrough in Primality Testing
Nonlinear Analysis, 2004 This paper briefly surveys the history of primality tests. The recently discovered deterministic polynomial time primality test due to Agrawal, Kayal and Saxena is presented and some improvements are shortly discussed.
R. Šleževičienė +2 more
doaj +6 more sources
Arab Journal of Basic and Applied Sciences, 2023 Lucas-Lehmer test is the current standard algorithm used for testing the primality of Mersenne numbers, but it may have limitations in terms of its efficiency and accuracy.
Moustafa Ibrahim
doaj +2 more sources
An RSA Scheme based on Improved AKS Primality Testing Algorithm
MATEC Web of Conferences, 2016 In applied cryptography, RSA is a typical asymmetric algorithm, which is used in electronic transaction and many other security scenarios. RSA needs to generate large random primes.
Wu Han Wei +4 more
doaj +3 more sources
Information Processing Letters, 1979 The author presents the following simplification of G. L. Miller's primality criterion [J. Comput. Syst. Sci. 13, 300--317 (1976; Zbl 0349.68025)]. Assume that for every integer \(d\equiv 1\pmod 4\), which is either prime or the product of two primes, the \(L\)-function \(\sum_{k=1}^\infty (k\mid d) k^{-s}\) satisfies the generalized Riemann hypothesis,
exaly +4 more sources
A primality test for Kpⁿ⁺¹ numbers and a generalization of Safe primes and Sophie Germain primes [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 In this paper, we provide a generalization of Proth's theorem for integers of the form Kpⁿ⁺¹. In particular, a primality test that requires a modular exponentiation (with a proper base a) similar to that of Fermat's test without the computation of any ...
Abdelrahman Ramzy
doaj +1 more source
On the calculation of integer sequences, associated with twin primes
Lietuvos Matematikos Rinkinys, 2023 The twin primes conjecture states that there are infinitely many twin primes. While studying this hypothesis, many important results were obtained, but the problem remains unsolved.
Igoris Belovas +2 more
doaj +3 more sources
New properties of divisors of natural number [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 The divisors of a natural number are very important for several areas of mathematics, representing a promising field in number theory. This work sought to analyze new relations involving the divisors of natural numbers, extending them to prime numbers ...
Hamilton Brito da Silva
doaj +1 more source
مجلة بغداد للعلوم, 2023 In this article, a new deterministic primality test for Mersenne primes is presented. It also includes a comparative study between well-known primality tests in order to identify the best test.
Yahia Awad, Ramiz Hindi, Haissam Chehade
doaj +1 more source
Toward the Unification of Physics and Number Theory [PDF]
Reports in Advances of Physical Sciences, 2019 This paper introduces the notion of simplex-integers and shows how, in contrast to digital numbers, they are the most powerful numerical symbols that implicitly express the information of an integer and its set theoretic substructure.
Klee Irwin
doaj +1 more source