Skip to main content
SpringerLink
Log in

Special Primes: Properties and Applications

  • Chapter
  • First Online:
Geometry, Algebra and Applications: From Mechanics to Cryptography

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 161))

  • 1247 Accesses

Abstract

This note presents a short survey on current results about the density and methods to obtain several kinds of special primes, together with primality algorithms.

Dedicamos este trabajo al profesor Jaime Muñoz Masqué, en su 65 \(^{\circ }\) aniversario, a quien nos sentimos profundamente agradecidos por su abundante y fructífero magisterio, que ha ejercido con generosidad y llaneza: ha sabido ser para nosotros, a la vez, un buen maestro y un maestro bueno.

We dedicate this work to Prof. Jaime Muñoz Masqué in his 65 birthday. We feel deeply indebted to his abundant and fruitful scientific mastery, practised in plain generosity. He became for us a true leader, brimming over with wisdom and bounty.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Augustin, D.: Cunningham chain records (2009). http://primerecords.dk/Cunningham_Chain_records.htm

  2. Bach, E., Shallit, J.: Factoring with cyclotomic polynomials. Math. Comput. 52, 201–219 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bateman, P., Horn, R.: A heuristic asymptotic formula concerning the distribution of prime numbers. Math. Comput. 16(79), 363–367 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bateman, P., Stemmler, R.: Waring’s problem for algebraic number fields and primes of the form \((p^r-1)/(p^d-1)\). Ill. J. Math. 6(1), 142–156 (1962)

    MathSciNet  MATH  Google Scholar 

  5. Durán Díaz, R., Muñoz Masqué, J.: Optimal strong primes. Inf. Process. Lett. 93(1), 47–52 (2005). doi:10.1016/j.ipl.2004.09.015

    Google Scholar 

  6. Durán Díaz, R., Hernández Encinas, L., Muñoz Masqué, J.: Computational aspects in the generation of higher-order safe primes. In: Romansky, R. (ed.) Proceedings of the International Conference on Information Technologies, vol. 2, pp. 33–40. Varna, Bulgaria (2008)

    Google Scholar 

  7. Durán Díaz, R., Hernández Encinas, L., Muñoz Masqué, J.: Higher-order safe primes with negative signature: an algorithmic approach. Int. J. Inf. Technol. Secur. 1, 13–24 (2009)

    Google Scholar 

  8. Forbes, T.: Prime clusters and Cunningham chains. Math. Comput. 68(228), 1739–1747 (1999). doi:10.1090/S0025-5718-99-01117-5

    Article  MathSciNet  MATH  Google Scholar 

  9. Granville, A.: Un buen milenio para los primos. La Gaceta de la RSME 12(3), 547–556 (2009)

    MathSciNet  Google Scholar 

  10. Guy, R.K.: Unsolved Problems in Number Theory. Springer, New York (1994)

    Book  MATH  Google Scholar 

  11. Maurer, U.M.: Fast generation of secure RSA-moduli with almost maximal diversity. In: Advances in Cryptology - EUROCRYPT’89, Lecture Notes in Computer Science, vol. 434, pp. 636–647. Springer, Berlin (1990)

    Google Scholar 

  12. Maurer, U.M.: Some number-theoretic conjectures and their relation to the generation of cryptographic primes. In: Mitchell, C. (ed.) Cryptography and Coding II, pp. 173–191. Clarendon Press, Oxford (1992). http://citeseer.ist.psu.edu/maurer92some.html

  13. Maurer, U.M.: Fast generation of prime numbers and secure public-key cryptographic parameters. J. Cryptol. 8(3), 123–155 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mihailescu, P.: Fast generation of provable primes using search in arithmetic progressions. In: Advances in Cryptology - CRYPTO’94, Lecture Notes in Computer Science, vol. 839, pp. 282–293. Springer, Berlin (1994)

    Google Scholar 

  15. Montgomery, P., Silverman, R.: An FFT extension to the \(p-1\) algorithm. Math. Comput. 54(190), 839–854 (1990)

    MathSciNet  MATH  Google Scholar 

  16. Pollard, J.: Theorems on factorization and primality testing. Math. Proc. Camb. Philos. Soc. 76, 521–528 (1974). doi:10.1017/S0305004100049252

    Article  MathSciNet  MATH  Google Scholar 

  17. Pomerance, C., Sorenson, J.: Counting the integers factorable via cyclotomic methods. J. Algorithms 19, 250–265 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  19. Teske, E., Williams, H.: A note on Shanks’s chains of primes. In: Proceedings of Algorithmic Number Theory Seminar, ANTS IV, Lecture Notes in Computer Science, vol. 1838, pp. 563–580. Springer, Berlin (2000)

    Google Scholar 

  20. Williams, H.: A \(p+1\) method of factoring. Math. Comput. 39(159), 225–234 (1982)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work has been partially funded by both Ministerio de Economía y Competitividad of Spain under grant number TIN2014-55325-C2-1-R (ProCriCiS), and Comunidad de Madrid, Spain, under grant number S2013/ICE-3095-CM (CIBERDINE).

Author information

Authors and Affiliations

  1. Departamento de Automática, Edificio Politécnico, Campus Universitario, 28871, Alcalá de Henares, Spain

    Raúl Durán Díaz

  2. Instituto de Tecnologías Físicas y de la Información, CSIC, C/ Serrano 144, 28006, Madrid, Spain

    Luis Hernández Encinas

Authors
  1. Raúl Durán Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luis Hernández Encinas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raúl Durán Díaz .

Editor information

Editors and Affiliations

  1. Departamento de Geometría y Topología, Universidad Complutense de Madrid, Madrid, Spain

    Marco Castrillón López

  2. Physical and Information Technology, Spanish National Research Council (CSIC), Madrid, Spain

    Luis Hernández Encinas

  3. Institute of Fundamental Physics, Spanish National Research Council (CSIC), Madrid, Spain

    Pedro Martínez Gadea

  4. Departamento de Matemática Aplicada, Universidad Politécnica de Madrid, Madrid, Spain

    Mª Eugenia Rosado María

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Durán Díaz, R., Hernández Encinas, L. (2016). Special Primes: Properties and Applications. In: Castrillón López, M., Hernández Encinas, L., Martínez Gadea, P., Rosado María, M. (eds) Geometry, Algebra and Applications: From Mechanics to Cryptography. Springer Proceedings in Mathematics & Statistics, vol 161. Springer, Cham. https://doi.org/10.1007/978-3-319-32085-4_7

Download citation

Publish with us

Policies and ethics

Search

Navigation