Relevant bibliographies by topics / Primality test / Journal articles
To see the other types of publications on this topic, follow the link: Primality test.

Journal articles on the topic 'Primality test'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 April 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Primality test.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Martino, Gabriele. "Primality Test." American Journal of Computational Mathematics 03, no. 01 (2013): 59–60. http://dx.doi.org/10.4236/ajcm.2013.31009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Sang-Un, and Myeong-Bok Choi. "The Primality Test." Journal of the Korea Society of Computer and Information 16, no. 8 (August 31, 2011): 103–8. http://dx.doi.org/10.9708/jksci.2011.16.8.103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Valluri, Maheswara Rao. "Combinatorial primality test." ACM Communications in Computer Algebra 54, no. 4 (December 2020): 129–33. http://dx.doi.org/10.1145/3465002.3465004.

Full text
Abstract:
In 1879, Laisant-Beaujeux gave the following result without proof: If n is a prime, then [EQUATION] This paper provides proofs of the result of Laisant-Beaujeux in two cases explicitly: (1) If an integer of the form n = 4k + 1, k > 0 is prime, then ([EQUATION]) and (2) If an integer of the form n = 4k + 3, k ≥ 0 is prime, then [EQUATION]. In addition, the author proposes important conjectures based on the converse of the above theorems which aim to establish primality of n. These conjectures are scrutinized by the given combinatorial primality test algorithm which can also distinguish patterns of prime n whether it is of the form 4k + 1 or 4k + 3.
APA, Harvard, Vancouver, ISO, and other styles
4

Chau, H. F., and H. K. Lo. "Primality Test Via Quantum Factorization." International Journal of Modern Physics C 08, no. 02 (April 1997): 131–38. http://dx.doi.org/10.1142/s0129183197000138.

Full text
Abstract:
We consider a probabilistic quantum implementation of a variation of the Pocklington–Lehmer N - 1 primality test using Shor's algorithm. O ( log 3 N log log N log log log N) elementary q-bit operations are required to determine the primality of a number N, making it (asymptotically) the fastest known primality test. Thus, the potential power of quantum mechanical computers is once again revealed.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Zhenxiang, Weiping Zhou, and Xianbei Liu. "A generalised Lucasian primality test." Bulletin of the Australian Mathematical Society 74, no. 3 (December 2006): 419–41. http://dx.doi.org/10.1017/s0004972700040478.

Full text
Abstract:
We present a primality test for numbers of the form Mh, n = h·2n ±1 (in particular with h divisible by 15), which generalises Berrizbeitia and Berry's test for such numbers with h ≢ 0 mod 5. With our generalised test, the primality of such a number Mh, n can be proved by means of a Lucas sequence with a seed determined by h and πq — primary irreducible divisor of a prime q ≡ 1 mod 4. We call the prime q a judge of the number Mh, n. We prescribe a sequence S of 48 primes ≡ 1 mod 4 in the interval [13, 2593] such that, for all odd h = 15t < 108 and for all n < 7.3 1011, each number Mh, n has a judge q in . Comparisons with Bosma's explicit primality criteria in “a well-defined finite sense” for the case h = 3t < 105 are given.
APA, Harvard, Vancouver, ISO, and other styles
6

Moshonkin, A. G., and I. M. Khamitov. "A New Probabilistic Primality Test." Journal of Mathematical Sciences 249, no. 1 (July 4, 2020): 79–84. http://dx.doi.org/10.1007/s10958-020-04920-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Couveignes, Jean-Marc, Tony Ezome, and Reynald Lercier. "A faster pseudo-primality test." Rendiconti del Circolo Matematico di Palermo 61, no. 2 (May 16, 2012): 261–78. http://dx.doi.org/10.1007/s12215-012-0088-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ega Gradini. "COMPARISON STUDY OF FERMAT, SOLOVAY-STRASSEN AND MILLER-RABIN PRIMALITY TEST USING MATHEMATICA 6.0." Visipena Journal 3, no. 1 (June 30, 2012): 1–10. http://dx.doi.org/10.46244/visipena.v3i1.48.

Full text
Abstract:
This paper presents three primality tests; Fermat test, Solovay-Strassen test, and Rabin-Miller test. Mathematica software is used to carry out the primality tests. The application of Fermat’s Litle Theorem as well as Euler’s Theorem on the tests was also discussed and this leads to the concept of pseudoprime. This paper is also discussed some results on pseudoprimes with certain range and do quantitative comparison. Those primality tests need to be evaluated in terms of its ability to compute as well as correctness in determining primality of given numbers. The answer to this is to create a source codes for those tests and evaluate them by using Mathematica 6.0. Those are Miller-Rabin test, Solovay-Strassen test, Fermat test and Lucas-Lehmer test. Each test was coded using an algorithm derived from number theoretic theorems and coded using the Mathematica version 6.0. Miller-Rabin test, SolovayStrassen test, and Fermat test are probabilistic tests since they cannot certainly identify the given number is prime, sometimes they fail. Using Mathematica 6.0, comparison study of primality test has been made and given the Miller- Rabin test as the most powerful test than other.
APA, Harvard, Vancouver, ISO, and other styles
9

Ishmukhametov, Shamil Talgatovich, Bulat Gazinurovich Mubarakov, and Ramilya Gakilevna Rubtsova. "On the Number of Witnesses in the Miller–Rabin Primality Test." Symmetry 12, no. 6 (June 1, 2020): 890. http://dx.doi.org/10.3390/sym12060890.

Full text
Abstract:
In this paper, we investigate the popular Miller–Rabin primality test and study its effectiveness. The ability of the test to determine prime integers is based on the difference of the number of primality witnesses for composite and prime integers. Let W ( n ) denote the set of all primality witnesses for odd n. By Rabin’s theorem, if n is prime, then each positive integer a < n is a primality witness for n. For composite n, the power of W ( n ) is less than or equal to φ ( n ) / 4 where φ ( n ) is Euler’s Totient function. We derive new exact formulas for the power of W ( n ) depending on the number of factors of tested integers. In addition, we study the average probability of errors in the Miller–Rabin test and show that it decreases when the length of tested integers increases. This allows us to reduce estimations for the probability of the Miller–Rabin test errors and increase its efficiency.
APA, Harvard, Vancouver, ISO, and other styles
10

Lee, Sang-Un. "A Step-by-Step Primality Test." Journal of the Institute of Webcasting, Internet and Telecommunication 13, no. 3 (June 30, 2013): 103–9. http://dx.doi.org/10.7236/jiibc.2013.13.3.103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Cohen, H., and A. K. Lenstra. "Implementation of a new primality test." Mathematics of Computation 48, no. 177 (January 1, 1987): 103. http://dx.doi.org/10.1090/s0025-5718-1987-0866102-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Bueso, José L., J. Gómez-Torrecillas, F. J. Lobillo, and F. J. Castro. "PRIMALITY TEST IN ITERATED ORE EXTENSIONS." Communications in Algebra 29, no. 3 (February 28, 2001): 1357–71. http://dx.doi.org/10.1081/agb-100001690.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Baillie, Robert, Andrew Fiori, and Samuel S. Wagstaff. "Strengthening the Baillie-PSW primality test." Mathematics of Computation 90, no. 330 (March 22, 2021): 1931–55. http://dx.doi.org/10.1090/mcom/3616.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Šleževičienė, R., J. Steuding, and S. Turskienė. "Recent Breakthrough in Primality Testing." Nonlinear Analysis: Modelling and Control 9, no. 2 (April 25, 2004): 171–84. http://dx.doi.org/10.15388/na.2004.9.2.15165.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
15

Berrizbeitia, Pedro, and T. G. Berry. "Biquadratic reciprocity and a Lucasian primality test." Mathematics of Computation 73, no. 247 (July 1, 2003): 1559–65. http://dx.doi.org/10.1090/s0025-5718-03-01575-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Donis-Vela, Alvaro, and Juan Carlos Garcia-Escartin. "A quantum primality test with order finding." Quantum Information and Computation 18, no. 13&14 (November 2018): 1143–51. http://dx.doi.org/10.26421/qic18.13-14-5.

Full text
Abstract:
Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer N, the test tries to find an element of the multiplicative group of integers modulo N with order N-1. If one is found, the number is known to be prime. During the test, we can also show most of the times N is composite with certainty (and a witness) or, after \log\log N unsuccessful attempts to find an element of order N-1, declare it composite with high probability. The algorithm requires O((\log n)^2 n^3) operations for a number N with n bits, which can be reduced to O(\log\log n (\log n)^3 n^2) operations in the asymptotic limit if we use fast multiplication.
APA, Harvard, Vancouver, ISO, and other styles
17

Ishmukhametov, Shamil Talgatovich, Ramilya Gakilevna Rubtsova, and Radmir Rinatovich Khusnutdinov. "On a primality test for natural numbers." Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, no. 2 (2022): 83–87. http://dx.doi.org/10.26907/0021-3446-2022-2-83-87.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Cohen, H., and A. K. Lenstra. "Supplement to Implementation of a New Primality Test." Mathematics of Computation 48, no. 177 (January 1987): s1. http://dx.doi.org/10.2307/2007908.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Barragán Moreno, Sandra. "A primality test for submodules using Grobner basis." Proyecciones (Antofagasta) 33, no. 1 (March 2014): 1–12. http://dx.doi.org/10.4067/s0716-09172014000100001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Hurd, Joe. "Verification of the Miller–Rabin probabilistic primality test." Journal of Logic and Algebraic Programming 56, no. 1-2 (May 2003): 3–21. http://dx.doi.org/10.1016/s1567-8326(02)00065-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Asaduzzaman, Abu, Anindya Maiti, and Chok Meng Yip. "Fast Effective Deterministic Primality Test Using CUDA/GPGPU." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 12, no. 3 (January 7, 2014): 3338–46. http://dx.doi.org/10.24297/ijct.v12i3.3247.

Full text
Abstract:
There are great interests in understanding the manner by which the prime numbers are distributed throughout the integers. Prime numbers are being used in secret codes for more than 60 years now. Computer security authorities use extremely large prime numbers when they devise cryptographs, like RSA (short for Rivest, Shamir, and Adleman) algorithm, for protecting vital information that is transmitted between computers. There are many primality testing algorithms including mathematical models and computer programs. However, they are very time consuming when the given number n is very big or n→∞. In this paper, we propose a novel parallel computing model based on a deterministic algorithm using central processing unit (CPU) / general-purpose graphics processing unit (GPGPU) systems, which determines whether an input number is prime or composite much faster. We develop and implement the proposed algorithm using a system with a 8-core CPU and a 448-core GPGPU. Experimental results indicate that upto 94.35x speedup can be achieved for 21-digit decimal numbers.
APA, Harvard, Vancouver, ISO, and other styles
22

Grau, José María, Antonio M. Oller-Marcén, and Daniel Sadornil. "A primality test for $Kp^n+1$ numbers." Mathematics of Computation 84, no. 291 (June 10, 2014): 505–12. http://dx.doi.org/10.1090/s0025-5718-2014-02849-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Grau, J. M., A. M. Oller-Marcén, and D. Sadornil. "A primality test for $$4Kp^n-1$$ numbers." Monatshefte für Mathematik 191, no. 1 (November 25, 2019): 93–101. http://dx.doi.org/10.1007/s00605-019-01354-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Ega Gradini. "FERMAT TEST AND THE EXISTENCE OF PSEUDOPRIMES." Visipena Journal 1, no. 1 (June 30, 2010): 37–44. http://dx.doi.org/10.46244/visipena.v1i1.21.

Full text
Abstract:
In this paper the author present Fermat test as one of primality tests. In order to perform the ability of the test, the algorithm of the test coded in Mathematica (6.0 version). The application of Fermat’s Little Theorem as well as Euler’s Theorem on the tests are also discussed and this leads to the concept of pseudoprime.
APA, Harvard, Vancouver, ISO, and other styles
25

Ega Gradini. "FERMAT TEST AND THE EXISTENCE OF PSEUDOPRIMES." Visipena Journal 2, no. 1 (June 30, 2011): 13–20. http://dx.doi.org/10.46244/visipena.v2i1.35.

Full text
Abstract:
In this paper the author present Fermat test as one of primality tests. In order to perform the ability of the test, the algorithm of the test coded in Mathematica (6.0 version). The application of Fermat’s Little Theorem as well as Euler’s Theorem on the tests are also discussed and this leads to the concept of pseudoprime.
APA, Harvard, Vancouver, ISO, and other styles
26

Wolf, Marc, and WOLF François. "Primality test and primes enumeration using odd numbers indexation." Transactions on Machine Learning and Artificial Intelligence 8, no. 2 (April 30, 2020): 11–41. http://dx.doi.org/10.14738/tmlai.82.8054.

Full text
Abstract:
Odd numbers can be indexed by the map k(n)=(n-3)⁄2,n∈2N+3. We first propose a basic primality test using this index function that was first introduced in [8]. Input size of operations is reduced which improves computational time by a constant. We then apply similar techniques to Atkin’s prime-numbers sieve which uses modulus operations and finally to Pritchard’s wheel sieve, in both case yielding similar results.
APA, Harvard, Vancouver, ISO, and other styles
27

Chaves, M. "95.23 Twin primes and a primality test by indivisibility." Mathematical Gazette 95, no. 533 (July 2011): 266–69. http://dx.doi.org/10.1017/s0025557200003004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Arnault, F. "Rabin-Miller primality test: composite numbers which pass it." Mathematics of Computation 64, no. 209 (January 1, 1995): 355. http://dx.doi.org/10.1090/s0025-5718-1995-1260124-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Ishmukhametov, S., and B. Mubarakov. "On practical aspects of the Miller-Rabin Primality Test." Lobachevskii Journal of Mathematics 34, no. 4 (October 2013): 304–12. http://dx.doi.org/10.1134/s1995080213040100.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Ishmukhametov, S. T., R. Rubtsova, and N. Savelyev. "The Error Probability of the Miller–Rabin Primality Test." Lobachevskii Journal of Mathematics 39, no. 7 (September 2018): 1010–15. http://dx.doi.org/10.1134/s1995080218070132.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Deng, Yingpu, and Chang Lv. "Primality test for numbers of the form Apn+wn." Journal of Discrete Algorithms 33 (July 2015): 81–92. http://dx.doi.org/10.1016/j.jda.2015.03.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Aouessare, Abdelilah, Abdeslam El haddouchi, and Mohamed Essaaidi. "A Novel Deterministic Mersenne Prime Numbers Test: Aouessare-El Haddouchi-Essaaidi Primality Test." International Journal of Computer Applications 100, no. 3 (August 20, 2014): 14–16. http://dx.doi.org/10.5120/17505-8053.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Deng, Yingpu, and Dandan Huang. "Primality test for numbers of the form (2p)2n+1." Acta Arithmetica 169, no. 4 (2015): 301–17. http://dx.doi.org/10.4064/aa169-4-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

SHINOHARA, N. "Inefficacious Conditions of the Frobenius Primality Test and Grantham's Problem." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E91-A, no. 11 (November 1, 2008): 3325–34. http://dx.doi.org/10.1093/ietfec/e91-a.11.3325.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

EKSTROM, AARON, CARL POMERANCE, and DINESH S. THAKUR. "INFINITUDE OF ELLIPTIC CARMICHAEL NUMBERS." Journal of the Australian Mathematical Society 92, no. 1 (February 2012): 45–60. http://dx.doi.org/10.1017/s1446788712000080.

Full text
Abstract:
AbstractIn 1987, Gordon gave an integer primality condition similar to the familiar test based on Fermat’s little theorem, but based instead on the arithmetic of elliptic curves with complex multiplication. We prove the existence of infinitely many composite numbers simultaneously passing all elliptic curve primality tests assuming a weak form of a standard conjecture on the bound on the least prime in (special) arithmetic progressions. Our results are somewhat more general than both the 1999 dissertation of the first author (written under the direction of the third author) and a 2010 paper on Carmichael numbers in a residue class written by Banks and the second author.
APA, Harvard, Vancouver, ISO, and other styles
36

Bouziane, Driss, and Abdelilah Kandri Rody. "On the resolvent of an ideal and some applications." International Journal of Mathematics and Mathematical Sciences 2003, no. 70 (2003): 4421–34. http://dx.doi.org/10.1155/s0161171203205378.

Full text
Abstract:
We give an algorithm to compute a resolvent of an algebraic variety without computing its irreducible components; we decompose the radical of an ideal into prime ideals and we test the primality of a regular ideal.
APA, Harvard, Vancouver, ISO, and other styles
37

Lichtman, Jared Duker, and Carl Pomerance. "Improved error bounds for the Fermat primality test on random inputs." Mathematics of Computation 87, no. 314 (February 23, 2018): 2871–90. http://dx.doi.org/10.1090/mcom/3314.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Kiss, Gyöngyvér. "A strategy for elliptic curve primality proving." Acta Universitatis Sapientiae, Informatica 7, no. 2 (December 1, 2015): 125–42. http://dx.doi.org/10.1515/ausi-2015-0015.

Full text
Abstract:
Abstract This paper deals with an implementation of the elliptic curve primality proving (ECPP) algorithm of Atkin and Morain. As the ECPP algorithm is not deterministic, we are developing a strategy to avoid certain situations in which the original implementation could get stuck and to get closer to the situation where the probability that the algorithm terminates successfully is 1. We apply heuristics and tricks in order to test the strategy in our implementation in Magma on numbers of up to 7000 decimal digits and collect data to show the advantages over previous implementations in practice.
APA, Harvard, Vancouver, ISO, and other styles
39

Riccardi, Marco. "Pocklington's Theorem and Bertrand's Postulate." Formalized Mathematics 14, no. 2 (January 1, 2006): 47–52. http://dx.doi.org/10.2478/v10037-006-0007-y.

Full text
Abstract:
Pocklington's Theorem and Bertrand's Postulate The first four sections of this article include some auxiliary theorems related to number and finite sequence of numbers, in particular a primality test, the Pocklington's theorem (see [19]). The last section presents the formalization of Bertrand's postulate closely following the book [1], pp. 7-9.
APA, Harvard, Vancouver, ISO, and other styles
40

TAO, TERENCE. "A REMARK ON PRIMALITY TESTING AND DECIMAL EXPANSIONS." Journal of the Australian Mathematical Society 91, no. 3 (December 2011): 405–13. http://dx.doi.org/10.1017/s1446788712000043.

Full text
Abstract:
AbstractWe show that for any fixed base a, a positive proportion of primes become composite after any one of their digits in the base a expansion is altered; the case where a=2 has already been established by Cohen and Selfridge [‘Not every number is the sum or difference of two prime powers’, Math. Comput.29 (1975), 79–81] and Sun [‘On integers not of the form ±pa±qb’, Proc. Amer. Math. Soc.128 (2000), 997–1002], using some covering congruence ideas of Erdős. Our method is slightly different, using a partially covering set of congruences followed by an application of the Selberg sieve upper bound. As a consequence, it is not always possible to test whether a number is prime from its base a expansion without reading all of its digits. We also present some slight generalisations of these results.
APA, Harvard, Vancouver, ISO, and other styles
41

Grau, José María, and Antonio M. Oller-Marcén. "An $\tilde{O}(\log^{2}(N))$ time primality test for generalized Cullen numbers." Mathematics of Computation 80, no. 276 (2011): 2315. http://dx.doi.org/10.1090/s0025-5718-2011-02489-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Damgard, Ivan Bjerre, and Gudmund Skovbjerg Frandsen. "An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate." Journal of Cryptology 19, no. 4 (September 25, 2006): 489–520. http://dx.doi.org/10.1007/s00145-006-0332-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Granger, Robert. "Could, or should, the ancient Greeks have discovered the Lucas-Lehmer test?" Mathematical Gazette 97, no. 539 (July 2013): 242–55. http://dx.doi.org/10.1017/s0025557200005830.

Full text
Abstract:
The Lucas-Lehmer (LL) test is the most efficient known for testing the primality of Mersenne numbers, i.e. the integers Ml = 2l − 1, for l ≥ 1. The Mersenne numbers are so-called in honour of the French scholar Marin Mersenne (1588-1648), who in 1644 published a list of exponents l ≤ 257 which he conjectured produced all and only those Ml which are prime, for l in this range, namely l = 2,3,5,7, 13, 17, 19,31,67, 127 and 257 [1]. Mersenne's list turned out to be incorrect, omitting the prime-producing l = 61, 89 and 107 and including the composite-producing l = 67 and 257, although this was not finally confirmed until 1947, using both the LL test and contemporary mechanical calculators [2]. The LL test is based on the following theorem.
APA, Harvard, Vancouver, ISO, and other styles
44

Berrizbeitia, Pedro, Mauricio Odremán, and Juan Tena Ayuso. "Primality test for numbers M with a large power of 5 dividing M4−1." Theoretical Computer Science 297, no. 1-3 (March 2003): 25–36. http://dx.doi.org/10.1016/s0304-3975(02)00617-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Philips, Anita, Jayakumar Jayaraj, Josh F.T., and Venkateshkumar P. "Enhanced RSA key encryption application for metering data in smart grid." International Journal of Pervasive Computing and Communications 17, no. 5 (November 12, 2021): 596–610. http://dx.doi.org/10.1108/ijpcc-07-2021-0172.

Full text
Abstract:
Purpose Digitizing of the electrical power grid promotes the advantages of efficient energy management alongside the possibilities of major vulnerabilities. A typical inadequacy that needs critical attention to ensure the seamless operation of the smart grid system remains in the data transmission between consumer premises smart devices and the utility centres. Many researches aim at establishing security protocols to ensure secure and efficient energy management resulting in perfect demand–supply balance. Design/methodology/approach In this paper, the authentication of the smart meter data has been proposed with enhanced Rivest–Shamir–Adleman (RSA) key encryption using an efficient way of generating large prime numbers. The trapdoor one-way function applied in the RSA algorithm makes it almost impossible for the reverse engineering attempts of cracking the key pair. Findings The algorithm for generating prime numbers has been tested both with the convention method and with the enhanced method of including a low-level primality test with a first few hundred primes. The combination of low-level and high-level primality tests shows an improvement in execution time of the algorithm. Originality/value There is a considerable improvement in the time complexities when using the combination method. This efficient generation of prime numbers can be successfully applied to the smart meter systems, thereby increasing the strength and speed of the key encryption.
APA, Harvard, Vancouver, ISO, and other styles
46

Berrizbeitia, Pedro, and Boris Iskra. "Deterministic primality test for numbers of the form $A^2.3^n+1$, $n \ge 3$ odd." Proceedings of the American Mathematical Society 130, no. 2 (September 19, 2001): 363–65. http://dx.doi.org/10.1090/s0002-9939-01-06100-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

HAN, YO-SUB, YAJUN WANG, and DERICK WOOD. "INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES." International Journal of Foundations of Computer Science 17, no. 02 (April 2006): 379–93. http://dx.doi.org/10.1142/s0129054106003887.

Full text
Abstract:
We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and develop a polynomial-time algorithm to determine infix-freeness of a regular language using state-pair graphs. We consider two cases: 1) A language is specified by a nondeterministic finite-state automaton and 2) a language is specified by a regular expression. Furthermore, we examine the prime infix-free decomposition of infix-free regular languages and design an algorithm for the infix-free primality test of an infix-free regular language. Moreover, we show that we can compute the prime infix-free decomposition in polynomial time. We also demonstrate that the prime infix-free decomposition is not unique.
APA, Harvard, Vancouver, ISO, and other styles
48

Apdilah, Dicky, Nurul Khairina, and Muhammad Khoiruddin Harahap. "Generating Mersenne Prime Number Using Rabin Miller Primality Probability Test to Get Big Prime Number in RSA Cryptography." IJISTECH 1, no. 1 (November 13, 2017): 1–7. http://dx.doi.org/10.30645/ijistech.v1i1.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Latorre, Jose I., and German Sierra. "Quantum computation of prime number functions." Quantum Information and Computation 14, no. 7&8 (May 2014): 577–88. http://dx.doi.org/10.26421/qic14.7-8-3.

Full text
Abstract:
We propose a quantum circuit that creates a pure state corresponding to the quantum superposition of all prime numbers less than $2^n$, where $n$ is the number of qubits of the register. This Prime state can be built using Grover's algorithm, whose oracle is a quantum implementation of the classical Miller-Rabin primality test. The Prime state is highly entangled, and its entanglement measures encode number theoretical functions such as the distribution of twin primes or the Chebyshev bias. This algorithm can be further combined with the quantum Fourier transform to yield an estimate of the prime counting function, more efficiently than any classical algorithm and with an error below the bound that allows for the verification of the Riemann hypothesis. Arithmetic properties of prime numbers are then, in principle, amenable to experimental verifications on quantum systems.
APA, Harvard, Vancouver, ISO, and other styles
50

Candra, Ade, Mohammad Andri Budiman, and Dian Rachmawati. "On Factoring The RSA Modulus Using Tabu Search." Data Science: Journal of Computing and Applied Informatics 1, no. 1 (July 18, 2017): 30–37. http://dx.doi.org/10.32734/jocai.v1.i1-65.

Full text
Abstract:
It is intuitively clear that the security of RSA cryptosystem depends on the hardness of factoring a very large integer into its two prime factors. Numerous studies about integer factorization in the field of number theory have been carried out, and as a result, lots of exact factorization algorithms, such as Fermat’s factorization algorithm, quadratic sieve method, and Pollard’s rho algorithm have been found. The factorization problem is in the class of NP (non-deterministic polynomial time). Tabu search is a metaheuristic in the field of artificial intelligence which is often used to solve NP and NP-hard problems; the result of this method is expected to be close-to-optimal (suboptimal). This study aims to factorize the RSA modulus into its two prime factors using tabu search by conducting experiments in Python programming language and to compare its time performance with an exact factorization algorithm, i.e. Pollard’s algorithm. The primality test is done with Lehmann’s algorithm.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Primality test' for other source types:
Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography