ANTS 2004: Algorithmic Number Theory pp 102-116 | Cite as

Pseudocubes and Primality Testing

  • P. Berrizbeitia
  • S. Müller
  • H. C. Williams
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3076)

Abstract

The recent ideas of Agrawal, Kayal, and Saxena have produced a milestone in the area of deterministic primality testing. Unfortunately, their method, as well as their successors are mainly of theoretical interest, as they are much too slow for practical applications.

Via a totally different approach, Lukes et al. developed a test which is conjectured to prove the primality of N in time only O((lg N)3 + 0(1)). Their (plausible) conjecture concerns the distribution of pseudosquares. These are numbers which locally behave like perfect squares but are nevertheless not perfect squares.

While squares are easy to deal with, this naturally gives rise to the question of whether the pseudosquares can be replaced by more general types of numbers. We have succeeded in extending the theory to the cubic case. To capture pseudocubes we rely on interesting properties of elements in the ring of Eisenstein integers and suitable applications of cubic residuacity. Surprisingly, the test itself is very simple as it can be formulated in the integers only. Moreover, the new theory appears to lead to an even more powerful primality testing algorithm than the one based on the pseudosquares.

Keywords

Prime Divisor Primality Test Primary Associate Quadratic Theory Gaussian Period 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics (to appear)Google Scholar
  2. 2.
    Avanzi, R., Mihailescu, P.: Efficient ’quasi - deterministic’ primality test improving AKS (2003), Available at http://www-math.uni-paderborn.de/preda/
  3. 3.
    Bach, E., Shallit, J.: Algorithmic number theory. Foundations of Computing Series, vol. 1. MIT Press, Cambridge (1996); Efficient algorithmsMATHGoogle Scholar
  4. 4.
    Bernstein, D.: Doubly focused enumeration of locally square polynomial values (2003), Available at http://cr.yp.to/focus.html
  5. 5.
    Bernstein, D.: Proving primality in essentially quartic random time (2003), Available at http://cr.yp.to/papers.html/quartic
  6. 6.
    Berrizbeitia, P.: Sharpening ”Primes is in P” for a large family of numbers (2002), Available at http://arxiv.org/abs/math.NT/0211334
  7. 7.
    Berrizbeitia, P., Berry, T.: Biquadratic reciprocity and a Lucasian primality test. Math. Comp., Posted July 1 (2003)Google Scholar
  8. 8.
    Berrizbeitia, P., Berry, T.G.: Cubic reciprocity and generalised Lucas-Lehmer tests for primality of A · 3n ±1. Proc. Amer. Math. Soc. 127(7), 1923–1925 (1999)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Cohen, H.: A course in computational algebraic number theory. Graduate Texts in Mathematics, vol. 138. Springer, Berlin (1993)MATHGoogle Scholar
  10. 10.
    Cox, D.A.: Primes of the form x2 + ny2. In: Fermat, class field theory and complex multiplication, A Wiley-Interscience Publication. John Wiley & Sons Inc. (1989)Google Scholar
  11. 11.
    Crandall, R., Pomerance, C.: Prime numbers. In: A computational perspective, Springer, New York (2001)Google Scholar
  12. 12.
    Guthmann, A.: Effective primality tests for integers of the forms N = k · 3n + 1 and N = k · 2m3n + 1. BIT 32(3), 529–534 (1992)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Ireland, K., Rosen, M.: A classical introduction to modern number theory, 2nd edn. Graduate Texts in Mathematics, vol. 84. Springer, New York (1990)MATHGoogle Scholar
  14. 14.
    Lemmermeyer, F.: Reciprocity laws. Springer Monographs in Mathematics. Springer, Berlin (2000); From Euler to EisensteinMATHGoogle Scholar
  15. 15.
    Lenstra, H.W.J., Pomerance, C.: Primality Testing with Gaussian Periods (2003) (manuscript)Google Scholar
  16. 16.
    Lukes, R.: A Very Fast Electronic Number Sieve. PhD thesis, University of Manitoba, Winnipeg (1995)Google Scholar
  17. 17.
    Lukes, R.F., Patterson, C.D., Williams, H.C.: Some results on pseudosquares. Math. Comp. 65(213), 361–372, S25–S27 (1996)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Schinzel, A.: On pseudosquares. In: New trends in probability and statistics, Vol. 4 (Palanga, 1996), VSP, Utrecht, pp. 213–220 (1997)Google Scholar
  19. 19.
    Stephens, A.J., Williams, H.C.: An open architecture number sieve. In: Number theory and cryptography (Sydney, 1989). London Math. Soc. Lecture Note Ser., vol. 154, pp. 38–75. Cambridge Univ. Press, Cambridge (1990)Google Scholar
  20. 20.
    Williams, H.C.: Primality testing on a computer. Ars Combin. 5, 127–185 (1978)MATHMathSciNetGoogle Scholar
  21. 21.
    Williams, H.C.: An M3 public-key encryption scheme. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 358–368. Springer, Heidelberg (1986)Google Scholar
  22. 22.
    Williams, K.S.: Mertens’ theorem for arithmetic progressions. J. Number Theory 6, 353–359 (1974)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • P. Berrizbeitia
    • 1
  • S. Müller
    • 2
  • H. C. Williams
    • 2
  1. 1.Departamento de Matematicas P. y A.Universidad Simón BolívarApartadoVenezuela
  2. 2.Centre for Applied Cryptographic ResearchUniversity of Calgary

Personalised recommendations