Primality Testing

dc.contributor.author	GRADINI, EGA
dc.date.accessioned	2016-09-23T01:48:30Z
dc.date.available	2016-09-23T01:48:30Z
dc.date.issued	2009-05
dc.description.abstract	Primality testing is the process to testing whether a given integer n is a prime or not There are two types of primality tests: deterministic and probabilistic. Deterministic test is primality test that determine with absolute certainty whether a number is prime or not. Lucas-Lehmer test is one of the deterministic primality tests. Probabilistic test also determine whether a given number n is a prime or not, but probabilistic test can potentially (although with very small probability) falsely identify a composite number as prime (not vice versa). However, they are in the general much faster than deterministic test. Fermat test, Solovay-Strassen test, and Miller-Rabin test are some of probabilistic primality test. This project discusses the principles, implementation and comparisons of four primality test; Lucas-Lehmer, Fermat, Solovay-Strassen, and Miller-Rabin test. In order to see the differences and perform the ability of them, the algorithm of the test coded in Mathematica (6.0 version).	en_US
dc.identifier.uri	http://hdl.handle.net/123456789/2586
dc.subject	Primality Testing	en_US
dc.title	Primality Testing	en_US
dc.type	Thesis	en_US

Now showing 1 - 1 of 1