Advertisement

Improved Primality Proving with Eisenstein Pseudocubes

  • Kjell Wooding
  • H. C. Williams
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6197)

Abstract

In August 2002, Agrawal, Kayal, and Saxena described an unconditional, deterministic algorithm for proving the primality of an integer N. Though of immense theoretical interest, their technique, even incorporating the many improvements that have been proposed since its publication, remains somewhat slow for practical application. This paper describes a new, highly efficient method for certifying the primality of an integer \(N \equiv 1 \pmod 3\), making use of quantities known as Eisenstein pseudocubes. This improves on previous attempts, including the peudosquare-based approach of Lukes et al., and the pseudosquare improvement proposed by Berrizbeitia, et al.

Keywords

Congruence Condition Distinct Zero Residue Character Unique Factorization Domain Perfect Power 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lukes, R.F., Patterson, C.D., Williams, H.C.: Some results on pseudosquares. Mathematics of Computation 65(213), S25–S27, 361–372 (1996) Google Scholar
  2. 2.
    Hall, M.: Quadratic residues in factorization. Bulletin of the American Mathematical Society 39, 758–763 (1933)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Williams, H.C.: Édouard Lucas and Primality Testing. Canadian Mathematical Society Series of Monographs and Advanced Texts, vol. 22. Wiley Interscience, Hoboken (1998)MATHGoogle Scholar
  4. 4.
    Williams, H.C.: Primality testing on a computer. Ars Combinatoria 5, 127–185 (1978)MATHMathSciNetGoogle Scholar
  5. 5.
    Berrizbeitia, P., Müller, S., Williams, H.C.: Pseudocubes and primality testing. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 102–116. Springer, Heidelberg (2004)Google Scholar
  6. 6.
    Wooding, K., Williams, H.C.: Doubly-focused enumeration of pseudosquares and pseudocubes. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 208–221. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Sorenson, J.P.: Sieving for pseudosquares and pseudocubes in parallel using doubly-focused enumeration and wheel datastructures. In: Hanrot, G., Morain, F., Thomé, E. (eds.) ANTS-IX. LNCS, vol. 6197, pp. 331–339. Springer, Heidelberg (2010)Google Scholar
  8. 8.
    Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, 2nd edn. Graduate Texts in Mathematics, vol. 84. Springer, Heidelberg (1990)MATHGoogle Scholar
  9. 9.
    Williams, H.C.: Some properties of a special set of recurring sequences. Pacific Journal of Mathematics 77(1), 273–285 (1978)MATHMathSciNetGoogle Scholar
  10. 10.
    Wooding, K.: The Sieve Problem in One- and Two-Dimensions. PhD thesis, The University of Calgary, Calgary, AB (April 2010), http://math.ucalgary.ca/~hwilliam/files/wooding10thesis.pdf
  11. 11.
    Bernstein, D.J.: Detecting perfect powers in essentially linear time. Mathematics of Computation 67, 1253–1283 (1998)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Cohen, H.: A Course in Computational Algebraic Number Theory, 4th edn. Springer, Heidelberg (1993)MATHGoogle Scholar
  13. 13.
    Williams, H.C.: An m 3 public-key encryption scheme. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 358–368. Springer, Heidelberg (1986)Google Scholar
  14. 14.
    Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press, Oxford (1979)MATHGoogle Scholar
  15. 15.
    Crandall, R., Pomerance, C.: Prime numbers: A computational Perspective, 2nd edn. Springer, New York (2005)MATHGoogle Scholar
  16. 16.
    Lehmer, D.H.: The sieve problem for all-purpose computers. Mathematical Tables and Other Aids to Computation 7(41), 6–14 (1953)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Kjell Wooding
    • 1
  • H. C. Williams
    • 1
  1. 1.Institute for Security, Privacy and Information AssuranceUniversity of CalgaryCalgaryCanada

Personalised recommendations