Editing Solovay–Strassen primality test (section)

{{Short description|Probabilistic primality test}}
The '''Solovay–Strassen primality test''', developed by [[Robert M. Solovay]] and [[Volker Strassen]] in 1977, is a [[randomized algorithm|probabilistic]] [[primality test]] to determine if a number is [[Composite number|composite]] or [[probable prime|probably prime]]. The idea behind the test was discovered by M. M. Artjuhov in 1967<ref>{{citation
 | last = Artjuhov | first = M. M.
 | journal = Acta Arithmetica
 | mr = 0213289
 | pages = 355–364
 | title = Certain criteria for primality of numbers connected with the little Fermat theorem
 | volume = 12
 | year = 1966–1967}}</ref>  
(see Theorem E in the paper). This test has been largely superseded by the [[Baillie–PSW primality test]] and the [[Miller–Rabin primality test]], but has great historical importance in showing the practical feasibility of the [[RSA (algorithm)|RSA]] [[cryptosystem]].