Primality testing revisited

@inproceedings{Davenport1992PrimalityTR,
  title={Primality testing revisited},
  author={James H. Davenport},
  booktitle={ISSAC '92},
  year={1992}
}
  • J. Davenport
  • Published in ISSAC '92 1992
  • Mathematics, Computer Science
Rabin’s algorithm is commonly used in computer algebra systems and elsewhere for primality testing. This paper presents an experience with this in the Axiom* computer algebra system. As a result of this experience, we suggest certain strengthenings of the algorithm. 
Some Primality Testing Algorithms
We describe the primality testing algorithms in use in some popular computer algebra systems, and give some examples where they break down in practice.
Primality testing of large numbers in Maple
Primality testing of large numbers is very important in many areas of mathematics, computer science and cryptography, and in recent years, many of the modern primality testing algorithms have beenExpand
Efficient polynomial time algorithms computing industrial-strength primitive roots
TLDR
An asymptotically O˜(√1/elog(p)+log2(p)) algorithm providing primitive roots of p with probability of correctness greater than 1-e and several O(logα(p)), α≤5.23, algorithms computing "Industrial-strength" primitive roots. Expand
The Carmichael numbers up to $10^{16}$
We extend our previous computations to show that there are 246683 Carmichael numbers up to $10^{16}$. As before, the numbers were generated by a back-tracking search for possible prime factorisationsExpand
Pseudoprimes: A Survey of Recent Results
TLDR
Public key cryptosystems require the use of large prime numbers, numbers with at least 256 bits (80 decimal digits), and one way of dealing with this problem is to use special primes built up using the converse of Fermat's theorem. Expand
A Bias-Free Quantum Random Number Generation Using Photon Arrival Time Selectively
We present a high-quality bias-free quantum random number generator (QRNG) using photon arrival time selectively, in accordance with the number of photon detection events within a sampling timeExpand
Design Trade Studies , and Risk and Uncertainty in Collaborative Design and Model Based Engineering : Methods , Tools , Research , and Practice
Complex systems engineering projects are increasingly prevalent in our world. Technical requirements for complex systems usually break out individual subsystems parameters. For instance, eachExpand
Robust efficient distributed RSA-key generation
TLDR
The disclosed method can be combined with proactive function sharing techniques to establish the first efficient, optimal-resilience, robust and proactively-secure RSA-based distributed trust services where the key is never entrusted to a single entity. Expand
Cited References
Editors' note: In the references cited we have used, as far as possible, the abbreviations for journals and reports used by Chemical Abstracts. A list of these abbrevi­ ations may be found in theExpand
A Study on Decision Making Procedures for Reduction of Carbon Emission and Energy Consumption of Process Systems
A Study on Decision Making Procedures for Reduction of Carbon Emission and Energy Consumption of Process Systems Seunghyok Kim School of Chemical and Biological Engineering The graduate school SeoulExpand
...
1
2
...

References

SHOWING 1-10 OF 26 REFERENCES
Probabilistic algorithm for testing primality
Abstract We present a practical probabilistic algorithm for testing large numbers of arbitrary form for primality. The algorithm has the feature that when it determines a number composite then theExpand
Distributed Primality Proving and the Primality of (23539+1)/3
  • F. Morain
  • Mathematics, Computer Science
  • EUROCRYPT
  • 1990
TLDR
The successful attempt at proving the primality of the l065-digit (23539+1)/3, the first ordinary Titanic prime, is described. Expand
Explicit bounds for primality testing and related problems
Many number-theoretic algorithms rely on a result of Ankeny, which states that if the Extended Riemann Hypothesis (ERH) is true, any nontrivial multiplicative subgroup of the integers modulo m omitsExpand
Analytic methods in the analysis and design of number-theoretic algorithms
This book makes a substantial contribution to the understanding of a murky area of number theory that is important to computer science, an area relevant to the design and analysis of number-theoreticExpand
On strong pseudoprimes to several bases
With Y'k denoting the smallest strong pseudoprime to all of the first k primes taken as bases we determine the exact values for 5, q6, q7, q8 and give upper bounds for V/9, / W t,' 1 . We discuss theExpand
A Course in Number Theory and Cryptography
1: Some Topics in Elementary Number Theory. 2: Finite Fields and Quadratic Residues. 3: Cryptography. 4: Public Key. 5: Primality and Factoring. 6: Elliptic Curves.
Statistical evidence for small generating sets
For an integer n, let G(n) denote the smallest x such that the primes < x generate the multiplicative group modulo n . We offer heuristic arguments and numerical data supporting the idea that G(n) <Expand
Private communication
vii
Modifications 18459366157::I, 21276028621::I ]::(List I) O(log4N) Modifications
  • 1980
Pinch 1993] and Jaeschke 1993] Modiications The following global declarations are made
  • Pinch 1993] and Jaeschke 1993] Modiications The following global declarations are made
  • 1980
...
1
2
3
...