Probabilistic algorithm for testing primality

Cites work

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?)
A Fast Monte-Carlo Test for Primality
Riemann's hypothesis and tests for primality

Cited in

(only showing first 100 items - show all)

Breaking SIDH in polynomial time
Quantum algorithms for algebraic problems
Improvements to RSA key generation and CRT on embedded devices
Notes on some new kinds of pseudoprimes
Multiparty generation of an RSA modulus
Reductions among number theoretic problems
Strong pseudoprimes to base 2
Algorithmic theory of free solvable groups: randomized computations.
On the distribution of Atkin and Elkies primes
On the effectiveness of a generalization of Miller's primality theorem
Efficient, Robust and Constant-Round Distributed RSA Key Generation
$\mathrm P \overset {?} {=} \mathrm{NP}$
Knottedness is in NP, modulo GRH
The structure factor of primes
Probabilistic quantifiers and games
Identifying half-twists using randomized algorithm methods.
On constructing 1-1 one-way functions
Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable
Equality in computer algebra and beyond.
A new primality test for natural integers
On types of elliptic pseudoprimes
Computing elliptic curves over $\mathbb {Q}$
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
Fast generation of prime numbers and secure public-key cryptographic parameters.
On the oracle complexity of factoring integers
Computation of prime numbers by using a probabilistic algorithm
Efficient multiple-precision integer division algorithm
Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes
Derandomization of quantum algorithm for triangle finding
Generalized strong pseudoprime tests and applications
GCD calculation in the search task of pseudoprime and strong pseudoprime numbers
Locally verifiable signature and key aggregation
A monad for randomized algorithms
Pseudorandom generators for space-bounded computation
The error probability of the Miller-Rabin primality test
Complexity classes of equivalence problems revisited
From worst to average case to incremental search bounds of the strong Lucas test
Multiparty generation of an RSA modulus
Construction of strong elliptic curves suitable for cryptographic applications
Randomized algorithms in combinatorial optimization: A survey
A probable prime test with high confidence
A simple approach for generating RSA keys
Optimal ancilla-free Pauli+V circuits for axial rotations
The generation of random numbers that are probably prime
RECYCLING RANDOM BITS IN PARALLEL
The Probability that a Random Probable Prime is Composite
On a problem posed by Steve Smale
A deterministic algorithm for the discrete logarithm problem in a semigroup
Strengthening the Baillie-PSW primality test
Primality testing with fewer random bits
Strong pseudoprimes to twelve prime bases
Integer factoring and compositeness witnesses
Boltzmann distribution on ``short integer partitions with power parts: limit laws and sampling
Realizing Hash-and-Sign Signatures under Standard Assumptions
Strong pseudoprimes to the first eight prime bases
Primes in quadratic unique factorization domains
From Monte Carlo to quantum computation
Bad witnesses for a composite number
Efficient algorithms for decomposing integers as sums of few tetrahedral numbers
On testing for zero polynomials by a set of points with bounded precision.
A connection between random variables and latin $k$-cubes
Note on class number parity of an abelian field of prime conductor
\textsc{Rings}: an efficient Java/Scala library for polynomial rings
Generating quasi-random sequences from semi-random sources
First direct implementation of a true random source on programmable hardware
Statistical Evidence for Small Generating Sets
Sequences of numbers generated by addition in formal groups and new primality and factorization tests
Universal tests for nonuniform distributions
Finding strong pseudoprimes to several bases
Idempotent factorizations in the cryptography classroom
1994–1995 Winter Meeting of the Association for Symbolic Logic
A new probabilistic primality test
Improved error bounds for the Fermat primality test on random inputs
A note on Rabin's probabilistic primality test
Frobenius pseudoprimes
Smale's 17th problem: average polynomial time to compute affine and projective solutions
Certifying giant nonprimes
A one-parameter quadratic-base version of the Baillie-PSW probable prime test
A heuristic irreducibility test for univariate polynomials
Recent developments in primality testing
An appraisal of computational complexity for operations researchers
Primality testing and factoring
Interactions of computational complexity theory and mathematics
A generalization of Miller’s primality theorem
Two kinds of strong pseudoprimes up to $10^{36}$
The Factorization of the Ninth Fermat Number
A deterministic version of Pollard's p-1 algorithm
Simulating BPP using a general weak random source
Machines that perform measurements
The Rabin-Monier theorem for Lucas pseudoprimes
Constructive complexity
Efficient RSA key generation and threshold Paillier in the two-party setting
Information and computation: Classical and quantum aspects
The Miller–Rabin test with randomized exponents
On practical aspects of the Miller-Rabin primality test
Determining periodicity: a case study of a functional specification
Hidden multiscale order in the primes
On the number of primality witnesses of composite integers
Compositeness test with nodal curves
A quantum differentiation of k-SAT instances

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)