Probabilistic algorithm for testing primality

Cites work

A Fast Monte-Carlo Test for Primality
scientific article; zbMATH DE number 3597592 (Why is no real title available?)
scientific article; zbMATH DE number 3221502 (Why is no real title available?)
scientific article; zbMATH DE number 3303655 (Why is no real title available?)
Riemann's hypothesis and tests for primality

Cited in

(only showing first 100 items - show all)

Algebraic algorithms in GF(q)
Randomized algorithms in combinatorial optimization: A survey
Generating quasi-random sequences from semi-random sources
Reductions among number theoretic problems
Computation of prime numbers by using a probabilistic algorithm
Probabilistic quantifiers and games
The generation of random numbers that are probably prime
Recent developments in primality testing
The influence of computers in the development of number theory
Primality testing and factoring
An appraisal of computational complexity for operations researchers
Constructive complexity
A heuristic irreducibility test for univariate polynomials
Scheduling with neural networks -- the case of the Hubble Space Telescope
Pseudorandom generators for space-bounded computation
A probable prime test with high confidence
Universal tests for nonuniform distributions
Primality testing with fewer random bits
On testing for zero polynomials by a set of points with bounded precision.
Equality in computer algebra and beyond.
A probabilistic algorithm for updating files over a communication link
Generalized strong pseudoprime tests and applications
A monad for randomized algorithms
Prime-number algorithm for public-key systems
Sequences of numbers generated by addition in formal groups and new primality and factorization tests
Identifying half-twists using randomized algorithm methods.
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
On the oracle complexity of factoring integers
Simulating BPP using a general weak random source
The error probability of the Miller-Rabin primality test
Integer factoring and compositeness witnesses
On the number of primality witnesses of composite integers
Primality tests, linear recurrent sequences and the Pell equation
Strong pseudoprimes to base 2
A new primality test for natural integers
A deterministic algorithm for the discrete logarithm problem in a semigroup
All congruences below stability-preserving fair testing or CFFD
A signature scheme from the finite field isomorphism problem
A new probabilistic primality test
Realistic analysis of some randomized algorithms
An unconditional improvement to the running time of the quadratic Frobenius test
GCD calculation in the search task of pseudoprime and strong pseudoprime numbers
Efficient RSA key generation and threshold Paillier in the two-party setting
On practical aspects of the Miller-Rabin primality test
Efficient multiple-precision integer division algorithm
Knottedness is in NP, modulo GRH
Machines that perform measurements
On completely factoring any integer efficiently in a single run of an order-finding algorithm
Groups of prime degree and the Bateman-Horn conjecture
An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach
Finding strong pseudoprimes to several bases
Frobenius pseudoprimes
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
A framework for deterministic primality proving using elliptic curves with complex multiplication
$\mathrm P \overset {?} {=} \mathrm{NP}$
Computing (and Life) Is All about Tradeoffs
A simple approach for generating RSA keys
Strong pseudoprimes to twelve prime bases
Primes in quadratic unique factorization domains
Quantum algorithms for algebraic problems
Information and computation: Classical and quantum aspects
Smale's 17th problem: average polynomial time to compute affine and projective solutions
On constructing 1-1 one-way functions
Note on class number parity of an abelian field of prime conductor
The Rabin-Monier theorem for Lucas pseudoprimes
Statistical Evidence for Small Generating Sets
The Factorization of the Ninth Fermat Number
A one-parameter quadratic-base version of the Baillie-PSW probable prime test
Compositeness test with nodal curves
Improved error bounds for the Fermat primality test on random inputs
Strong pseudoprimes to the first eight prime bases
Construction of strong elliptic curves suitable for cryptographic applications
Algorithms for the Multiplication Table Problem
Efficient, Robust and Constant-Round Distributed RSA Key Generation
Optimal ancilla-free Pauli+V circuits for axial rotations
Expander graphs and their applications
A generalization of Miller’s primality theorem
The Miller–Rabin test with randomized exponents
A deterministic version of Pollard's p-1 algorithm
Two kinds of strong pseudoprimes up to $10^{36}$
Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable
Realizing Hash-and-Sign Signatures under Standard Assumptions
Classifying the computational complexity of problems
On the Number of Elliptic Pseudoprimes
Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
A note on Rabin's probabilistic primality test
Simple Constructions of Almost k-wise Independent Random Variables
Algorithmic theory of free solvable groups: randomized computations.
On the distribution of Atkin and Elkies primes
The Probability that a Random Probable Prime is Composite
Rabin-Miller Primality Test: Composite Numbers Which Pass It
Determining periodicity: a case study of a functional specification
Finding strong pseudoprimes to several bases. II
Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime
Computing elliptic curves over $\mathbb {Q}$
The structure factor of primes
Detecting dynamical changes in time series by using the Jensen Shannon divergence
Finding 𝐶₃-strong pseudoprimes

This page was built for publication: Probabilistic algorithm for testing primality

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