FAQ

Solovay–Strassen primality test

Known as: Solovay-Strassen test, Solovay-Strassen algorithm, Solovay-Strassen primality test 
The Solovay–Strassen primality test, developed by Robert M. Solovay and Volker Strassen, is a probabilistic test to determine if a number is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2017
01219792017

Related topics

Related topics

14 relations
Complexity classCryptographyCryptosystemDecision problem
(More)

Related mentions per year

Related mentions per year

1939-2018
19401960198020002020
Solovay–Strassen primality test
Cryptography
Randomized algorithm
Decision problem
Cryptosystem
RP (complexity)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The analysis of HOD below the theory AD + + “ The largest Suslin cardinal is a member of the Solovay sequence ” ∗ †
The main contribution of this paper is a the analysis of HOD below the theory AD+ + “The largest Suslin cardinal is a member of… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Explicit Bounds for Primality Testing and Related Problems
Many number-theoretic algorithms rely on a result of Ankeny, which states that if the Extended Riemann Hypothesis (ERH) is true… (More)
  • table 2
  • table 3
Is this relevant?
2008
2008
On an implementation of the Solovay-Kitaev algorithm
In quantum computation we are given a finite set of gates and we have to perform a desired operation as a product of them. The… (More)
Is this relevant?
2007
2007
F U N D a M E N T a Mathematicae a Partition Theorem for Α-large Sets
Working with Hardy hierarchy and the notion of largeness determined by it, we define the notion of a partition of a finite set of… (More)
Is this relevant?
2007
2007
Primality Testing with Fewer Random Bits 1
In the usual formulations of the Miller-Rabin and Solovay-Strassen primality testing algorithms, to test a number n for primality… (More)
Is this relevant?
2006
2006
The BQP-hardness of approximating the Jones Polynomial
Following the work by Kitaev, Freedman and Wang [1], Aharonov, Jones and Landau [3] recently gave an explicit and efficient… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
Primality testing with fewer random bits
In the usual formulations of the Miller-Rabin and Solovay-Strassen primality testing algorithms for a numbern, the algorithm… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Almost All Primes Can Be Quickly Certified
This paper presents a new probabilistie primality test. Upon termination the test outputs "composite" or "prime", along with a… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
On distinguishing prime numbers from composite numbers
A new algorithm for testing primality is presented. The algorithm is distinguishable from the lovely algorithms of Solvay and… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
A subexponential algorithm for the discrete logarithm problem with applications to cryptography
In 1870 Bouniakowsky [2 J publ ished an algorithm to solve the congruence aX _ bMOD (q). While his algorithm contained several… (More)
Is this relevant?