Recent developments in primality proving
From MaRDI portal
Publication:1297591
DOI10.1016/S0378-4754(99)00051-8zbMATH Open0927.68123OpenAlexW2103350669MaRDI QIDQ1297591FDOQ1297591
Authors: 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
Recommendations
Symbolic computation and algebraic computation (68W30) Primality (11Y11) Cyclotomic extensions (11R18)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On distinguishing prime numbers from composite numbers
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete Weighted Transforms and Large-Integer Arithmetic
- Title not available (Why is that?)
- Divisors in Residue Classes
- Prime numbers and computer methods for factorization.
- Elliptic Curves and Primality Proving
- Title not available (Why is that?)
- Primality Testing and Jacobi Sums
- Title not available (Why is that?)
- Strong Primality Tests that are Not Sufficient
- Diophantine Representation of the Set of Prime Numbers
- On Lucas's and Pepin's Tests for the Primeness of Mersenne's Numbers
- Primes are nonnegative values of a polynomial in 10 variables
- New Primality Criteria and Factorizations of 2 m ± 1
- Title not available (Why is that?)
- Some Algorithms for Prime Testing Using Generalized Lehmer Function
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
Uses Software
This page was built for publication: Recent developments in primality proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297591)
