Some algorithms for generation of large prime numbers

MaRDI QIDQ1276025zbMATH OpenFDO

Authors O. N. Vasilenko

Publication date 14 January 1999

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

algorithm of constructionGauss sumsJacobi sumslarge prime number

Mathematics Subject Classification ID

Primes (11A41) Gauss and Kloosterman sums; generalizations (11L05) Factorization (11Y05)

Review text

Some present-day methods of constructing large prime numbers \(n\) are based on the complete or partial decomposition of \(n-1\) into factors [see, for example, \textit{D. Plaisted}, Theor. Comput. Sci. 9, 1-16 (1979; Zbl 0421.10007)]. In this note the author shows how these methods may be refined in terms of the tests with Gauss and Jacobi sums.

Recommendations

• scientific article; zbMATH DE number 697832
• Primality Testing and Jacobi Sums
• Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
• Recent developments in primality testing

Cited in

(1)

• scientific article; zbMATH DE number 697832 (Why is no real title available?)

This page was built for publication: Some algorithms for generation of large prime numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276025)