A Fast Monte-Carlo Test for Primality
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5845877
- A faster pseudo-primality test
- scientific article; zbMATH DE number 4215363
- A new probabilistic primality test
- An $O(n^{1/10.89))$ Primality Testing Algorithm,$
- scientific article; zbMATH DE number 579167
- Fast Primality Tests for Numbers Less Than 50 ⋅10 9
- Primality testing with fewer random bits
- Deterministic and probabilistic primality tests
Cited in
(94)- Irreducibility of multivariate polynomials
- Generating quasi-random sequences from semi-random sources
- Approximation to measurable functions and its relation to probabilistic computation
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes
- A nonlinear public key cryptosystem
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Minimum disclosure proofs of knowledge
- The generation of random permutations on the fly
- Probabilistic quantifiers and games
- The generation of random numbers that are probably prime
- Fast verification, testing, and generation of large primes
- Probabilistic algorithm for testing primality
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Evaluation and comparison of two efficient probabilistic primality testing algorithms
- Non deterministic polynomial optimization problems and their approximations
- Discrete extremal problems
- Semantics of probabilistic programs
- Recent developments in primality testing
- Some observations on the probabilistic algorithms and NP-hard problems
- An introduction to randomized algorithms
- A heuristic irreducibility test for univariate polynomials
- Nested annealing: A provable improvement to simulated annealing
- Scheduling with neural networks -- the case of the Hubble Space Telescope
- A note on Rabin's nearest-neighbor algorithm
- Universal classes of hash functions
- Primality testing with fewer random bits
- Verification of the Miller-Rabin probabilistic primality test.
- On testing for zero polynomials by a set of points with bounded precision.
- Dynamical analysis of a class of Euclidean algorithms.
- A probabilistic algorithm for updating files over a communication link
- Generalized strong pseudoprime tests and applications
- Predicting zero coefficients in formal power series computations.
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Estimation of singular values of very large matrices using random sampling
- A monad for randomized algorithms
- Randomised algorithms
- The time-precision tradeoff problem on on-line probabilistic Turing machines
- One complexity theorist's view of quantum computing
- From Monte Carlo to quantum computation
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- A connection between random variables and latin \(k\)-cubes
- The error probability of the Miller-Rabin primality test
- A new probabilistic primality test
- Homomorphic public-key cryptosystems and encrypting Boolean circuits
- Error-bounded probabilistic computations between MA and AM
- What is quantum computation.
- Random sampling in computational algebra: Helly numbers and violator spaces
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- Encryption switching protocols
- Book review of: Inevitable randomness in discrete mathematics, by József Beck
- Inexactness and a future of computing
- scientific article; zbMATH DE number 5845877 (Why is no real title available?)
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- On constructing 1-1 one-way functions
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- A relation between correctness and randomness in the computation of probabilistic algorithms
- Explicit Bounds for Primality Testing and Related Problems
- Randomized compositeness testing with Chebyshev polynomials
- Expander graphs and their applications
- A generalization of Miller’s primality theorem
- A Performance Analysis of a Simple Prime-Testing Algorithm
- On the Number of False Witnesses for a Composite Number
- Fast Primality Tests for Numbers Less Than 50 ⋅10 9
- Classifying the computational complexity of problems
- Some remarks concerning the M.I.T. public-key cryptosystem
- An improved Monte Carlo factorization algorithm
- Asymptotically Fast Factorization of Integers
- A note on Rabin's probabilistic primality test
- Algorithmic theory of free solvable groups: randomized computations.
- Some Observations on Primality Testing
- A note on monte carlo primality tests and algorithmic information theory
- Determining periodicity: a case study of a functional specification
- On Primality Testing Using Purely Divisionless Operations
- An analogue of the Solovay-Strassen test in quadratic Euclidean rings
- Probabilistic_Prime_Tests
- Primality testing
- The computational complexity of recognizing permutation functions
- Factoring polynomials over finite fields: A survey
- A lower bound for primality
- Certifying giant nonprimes
- Locally verifiable signature and key aggregation
- Learning a performance metric of Buchberger's algorithm
- Interactions of computational complexity theory and mathematics
- How real is incomputability in physics?
- On types of elliptic pseudoprimes
- On a problem posed by Steve Smale
- Polynomial algorithms for primality testing in algebraic number fieldswith class number 1
- The 1982 ACM Turing Award lecture. An overview of computational complexity
- Derandomization of quantum algorithm for triangle finding
- Complexity classes of equivalence problems revisited
- A probabilistic lower bound for checking disjointness of sets
- Probabilistic Turing machines and recursively enumerable Dedekind cuts
- Efficient, perfect polynomial random number generators
- A low complexity probabilistic test for integer multiplication
This page was built for publication: A Fast Monte-Carlo Test for Primality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4113883)
