Recent developments in primality testing
From MaRDI portal
Recommendations
Cites work
- A Fast Monte-Carlo Test for Primality
- A method for obtaining digital signatures and public-key cryptosystems
- A Method of Factoring and the Factorization of F 7
- A new lower bound for the pseudoprime counting function
- A note on monte carlo primality tests and algorithmic information theory
- Approximate formulas for some functions of prime numbers
- Asymptotically Fast Factorization of Integers
- Cryptology: The mathematics of secure communication
- Every Prime Has a Succinct Certificate
- scientific article; zbMATH DE number 3159593 (Why is no real title available?)
- scientific article; zbMATH DE number 3719216 (Why is no real title available?)
- scientific article; zbMATH DE number 3512203 (Why is no real title available?)
- scientific article; zbMATH DE number 3521895 (Why is no real title available?)
- scientific article; zbMATH DE number 3597592 (Why is no real title available?)
- scientific article; zbMATH DE number 3630832 (Why is no real title available?)
- scientific article; zbMATH DE number 3637954 (Why is no real title available?)
- Miller's primality test
- New Primality Criteria and Factorizations of 2 m ± 1
- On Almost Primes
- On the Distribution of Pseudoprimes
- On the exact number of primes less than a given limit
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- Some Algorithms for Prime Testing Using Generalized Lehmer Function
- Some Observations on Primality Testing
- Some probabilistic remarks on Fermat's last theorem
- The 24th Mersenne Prime
- The 25th and 26th Mersenne Primes
- The least quadratic non residue
- The Pseudoprimes to 25 ⋅10 9
- Three New Mersenne Primes and a Statistical Theory
Cited in
(44)- Number theory and the real world
- Carmichael's ``Empirical Theorem
- The influence of computers in the development of number theory
- Miller's primality test
- Some algorithms for generation of large prime numbers
- Generalized strong pseudoprime tests and applications
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P.
- Primality testing of large numbers in Maple
- A new probabilistic primality test
- GCD calculation in the search task of pseudoprime and strong pseudoprime numbers
- Sieve algorithms for perfect power testing
- Zassenhaus conjecture on torsion units holds for \(\mathrm{PSL}(2,p)\) with \(p\) a Fermat or Mersenne prime
- On the running time of the Adleman-Pomerance-Rumely primality test
- scientific article; zbMATH DE number 1643943 (Why is no real title available?)
- Even faster integer multiplication
- An \(\tilde{O}(\log^{2}(N))\) time primality test for generalized Cullen numbers
- On the stability of m-sequences
- Prime Number Generation Based On Pocklington's Theorem
- Proving primality in essentially quartic random time
- A generalization of Miller’s primality theorem
- Deterministic and probabilistic primality tests
- Testing numbers for primality
- scientific article; zbMATH DE number 3912454 (Why is no real title available?)
- Primality Testing and Jacobi Sums
- scientific article; zbMATH DE number 4095550 (Why is no real title available?)
- Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
- scientific article; zbMATH DE number 4103163 (Why is no real title available?)
- scientific article; zbMATH DE number 1186934 (Why is no real title available?)
- The Probability that a Random Probable Prime is Composite
- scientific article; zbMATH DE number 1210365 (Why is no real title available?)
- scientific article; zbMATH DE number 493094 (Why is no real title available?)
- Rabin-Miller Primality Test: Composite Numbers Which Pass It
- A characterization of nonprime powers
- scientific article; zbMATH DE number 953285 (Why is no real title available?)
- On the complexity of testing primality by homogeneous structures
- Further investigations with the strong probable prime test
- The RSA cryptography processor
- An overview of factoring
- scientific article; zbMATH DE number 5590087 (Why is no real title available?)
- Extending Babbage's (non-)primality tests
- Primality testing
- Gaps, ambiguity, and establishing complexity-class containments via iterative constant-setting
- Factoring on a computer
This page was built for publication: Recent developments in primality testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160213)
