Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
A LLT-like test for proving the primality of Fermat numbers  [PDF]
Tony Reix
Mathematics , 2007,
Abstract: This paper provides a proof of a LLT-like test for Fermat numbers, based on the properties of Lucas Sequences and on the method of Lehmer.
Four primality testing algorithms  [PDF]
Rene Schoof
Mathematics , 2008,
Abstract: In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time algorithm to prove that a given numer is either prime or composite. The third and fourth primality tests are at present most widely used in practice. Both tests are capable of proving that a given number is prime or composite, but neither algorithm is deterministic. The third algorithm exploits the arithmetic of cyclotomic fields. Its running time is almost, but not quite polynomial time. The fourth algorithm exploits elliptic curves. Its running time is difficult to estimate, but it behaves well in practice.
Primality tests for 2^kn-1 using elliptic curves  [PDF]
Yu Tsumura
Mathematics , 2009,
Abstract: We propose some primality tests for 2^kn-1, where k, n in Z, k>= 2 and n odd. There are several tests depending on how big n is. These tests are proved using properties of elliptic curves. Essentially, the new primality tests are the elliptic curve version of the Lucas-Lehmer-Riesel primality test. Note:An anonymous referee suggested that Benedict H. Gross already proved the same result about a primality test for Mersenne primes using elliptic curve.
Elliptic periods and primality proving  [PDF]
Jean-Marc Couveignes,Tony Ezome,Reynald Lercier
Mathematics , 2008,
Abstract: We define the ring of elliptic periods modulo an integer $n$ and give an elliptic version of the AKS primality criterion.
Cyclotomy Primality Proofs and their Certificates  [PDF]
Preda Mihailescu
Mathematics , 2007,
Abstract: The first efficient general primality proving method was proposed in the year 1980 by Adleman, Pomerance and Rumely and it used Jacobi sums. The method was further developed by H. W. Lenstra Jr. and more of his students and the resulting primality proving algorithms are often referred to under the generic name of Cyclotomy Primality Proving (CPP). In the present paper we give an overview of the theoretical background and implementation specifics of CPP, such as we understand them in the year 2007.
Primality Testing Using Complex Integers and Pythagorean Triplets  [PDF]
Boris Verkhovsky
Int'l J. of Communications, Network and System Sciences (IJCNS) , 2012, DOI: 10.4236/ijcns.2012.59062
Abstract: Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design stage of a cryptographic system is a formidable task. Fermat primality checking is one of the simplest of all tests. Unfortunately, there are composite integers (called Carmichael numbers) that are not detectable by the Fermat test. In this paper we consider modular arithmetic based on complex integers; and provide several tests that verify the primality of real integers. Although the new tests detect most Carmichael numbers, there are a small percentage of them that escape these tests.
Pseudopowers and primality proving  [cached]
Pedro Berrizbeitia,Siguna Mueller,Hugh C. Williams
Contributions to Discrete Mathematics , 2007,
Abstract: It has been known since the 1930s that so-called pseudosquares yield a very powerful machinery for the primality testing of large integers N. In fact, assuming reasonable heuristics (which have been confirmed for numbers to 2^80) this gives a deterministic primality test in time O((lg N)^(3+o(1))), which many believe to be best possible. In the 1980s D.H. Lehmer posed a question tantamount to whether this could be extended to pseudo r-th powers. Very recently, this was accomplished for r=3. In fact, the results obtained indicate that r=3 might lead to an even more powerful algorithm than r=2. This naturally leads to the challenge if and how anything can be achieved for r>3. The extension from r = 2 to r = 3 relied on properties of the arithmetic of the Eisenstein ring of integers Z[zeta_3], including the Law of Cubic Reciprocity. In this paper we present a generalization of our result for any odd prime r. The generalization is obtained by studying the properties of Gaussian and Jacobi sums in cyclotomic ring of integers, which are tools from which the r-th power Eisenstein Reciprocity Law is derived, rather than from the law itself. While r=3 seems to lead to a more efficient algorithm than r=2, we show that extending to any r>3 does not appear to lead to any further improvements.
Primality tests for Fermat numbers and 2^(2k+1)\pm2^(k+1)+1  [PDF]
Yu Tsumura
Mathematics , 2009,
Abstract: Robert Denomme and Gordan Savin made a primality test for Fermat numbers 2^(2^k)+1 using elliptic curves. We propose another primality test using elliptic curves for Fermat numbers and also give primality tests for integers of the form 2^(2k+1)\pm2^(k+1)+1.
Early Record of Divisibility and Primality  [PDF]
Subhash Kak
Mathematics , 2009,
Abstract: We provide textual evidence on divisibility and primality in the ancient Vedic texts of India. Concern with divisibility becomes clear from the listing of all the fifteen pairs of divisors of the number 720. The total number of pairs of divisors of 10,800 is also given. The motivation behind finding the divisors was the theory that the number of divisors of a certain periodic process is related to the count associated with some other periodic process. For example, 720 (days and nights of the year) has 15 pairs of divisors, and this was related to the 15 days of the waxing and waning of the moon. Numbers that have no divisors appeared to have been used to symbolize the "transcendent" that is beyond periodicity and change.
How Do You Measure Primality?  [PDF]
Christopher O'Neill,Roberto Pelayo
Mathematics , 2014,
Abstract: In commutative monoids, the $\omega$-value measures how far an element is from being prime. This invariant, which is important in understanding the factorization theory of monoids, has been the focus of much recent study. This paper provides detailed examples and an overview of known results on $\omega$-primality, including several recent and surprising contributions in the setting of numerical monoids. As many questions related to $\omega$-primality remain, we provide a list of open problems accessible to advanced undergraduate students and beginning graduate students.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.