About: Solovay–Strassen primality test

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Solovay–Strassen primality test Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Cricketer, within Data Space : el.dbpedia.org associated with source document(s)

The Solovay–Strassen primality test, developed by Robert M. Solovay and Volker Strassen in 1977, is a probabilistic test to determine if a number is composite or probably prime. The idea behind the test was discovered by M. M. Artjuhov in 1967 (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 cryptosystem. The Solovay–Strassen test is essentially an Euler–Jacobi pseudoprime test.

Attributes	Values
rdf:type	cricketer
rdfs:label	Solovay–Strassen primality test (en)
rdfs:comment	The Solovay–Strassen primality test, developed by Robert M. Solovay and Volker Strassen in 1977, is a probabilistic test to determine if a number is composite or probably prime. The idea behind the test was discovered by M. M. Artjuhov in 1967 (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 cryptosystem. The Solovay–Strassen test is essentially an Euler–Jacobi pseudoprime test. (en)
sameAs	Solovay–Strassen primality test
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:Math dbt:Reflist dbt:Number_theoretic_algorithms
Subject	Primality tests Randomized algorithms Modular arithmetic
gold:hypernym	Test
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Solovay–Strassen_primality_test?oldid=1065525116&ns=0
Wikipage page ID	1013089 (xsd:integer)
page length (characters) of wiki page	10054 (xsd:nonNegativeInteger)
Wikipage revision ID	1065525116 (xsd:integer)
has abstract	The Solovay–Strassen primality test, developed by Robert M. Solovay and Volker Strassen in 1977, is a probabilistic test to determine if a number is composite or probably prime. The idea behind the test was discovered by M. M. Artjuhov in 1967 (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 cryptosystem. The Solovay–Strassen test is essentially an Euler–Jacobi pseudoprime test. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Solovay–Strassen_primality_test
is Wikipage redirect of	Solovay-Strassen primality test Euler liars Euler witness Euler liar Solovay-Strassen Solovay-Strassen algorithm Solovay-Strassen test
is Link from a Wikipage to another Wikipage of	Monte Carlo algorithm Jacobi symbol Computational complexity of mathematical operations List of computer scientists Miller–Rabin primality test Euler liars Euler witness Fermat primality test Fermat pseudoprime Euler's criterion Euler liar Lucas pseudoprime
is known for of	Robert M. Solovay

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software