Recent developments in primality proving

DOI10.1016/S0378-4754(99)00051-8zbMath0927.68123OpenAlexW2103350669MaRDI QIDQ1297591

Preda Mihaĭlescu

Publication date: 7 September 1999

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-4754(99)00051-8

zbMATH Keywords

geometrycyclotomyprimality proving

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cyclotomic extensions (11R18) Primality (11Y11)

Uses Software

• LiDIA
• ECPP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distinguishing prime numbers from composite numbers
• Primes are nonnegative values of a polynomial in 10 variables
• Prime numbers and computer methods for factorization.
• Elliptic Curves and Primality Proving
• Divisors in Residue Classes
• Primality Testing and Jacobi Sums
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Strong Primality Tests that are Not Sufficient
• New Primality Criteria and Factorizations of 2 m ± 1
• Diophantine Representation of the Set of Prime Numbers
• Some Algorithms for Prime Testing Using Generalized Lehmer Function
• Discrete Weighted Transforms and Large-Integer Arithmetic
• On Lucas's and Pepin's Tests for the Primeness of Mersenne's Numbers