Primality testing revisited

@inproceedings{Davenport1992PrimalityTR,
  title={Primality testing revisited},
  author={J. Davenport},
  booktitle={ISSAC '92},
  year={1992}
}
  • J. Davenport
  • Published in ISSAC '92 1992
  • 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. 
    View on ACM
    staff.bath.ac.uk
    10 Citations
    Background Citations
    2

    Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    10 Citations
    Citation Type

    Citation Type

    Some Primality Testing Algorithms
    • 10
    Primality testing of large numbers in Maple
    • 5
    Efficient polynomial time algorithms computing industrial-strength primitive roots
    • 11
    • PDF
    The Carmichael numbers up to $10^{16}$
    • 35
    • PDF
    Pseudoprimes: A Survey of Recent Results
    • 1
    A Bias-Free Quantum Random Number Generation Using Photon Arrival Time Selectively
    • 246
    • PDF
    Robust efficient distributed RSA-key generation
    • 124
    Design Trade Studies , and Risk and Uncertainty in Collaborative Design and Model Based Engineering : Methods , Tools , Research , and Practice
    Cited References
    • 44
    A Study on Decision Making Procedures for Reduction of Carbon Emission and Energy Consumption of Process Systems

    References

    SHOWING 1-2 OF 2 REFERENCES
    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