Frobenius pseudoprime

Frobenius pseudoprime

In number theory, a Frobenius pseudoprime is a composite number which passes a three-step probable prime test set out by Jon Grantham in section 3 of his paper "Frobenius pseudoprimes". [Jon Grantham. [ Frobenius pseudoprimes] . "Mathematics of Computation", 70 (234): 873-891. 2001.] Although a single round of Frobenius is slower than a single round of most standard tests, it has the advantage of a much smaller worst-case per-round error bound of 1/7710, which would require 7 rounds to achieve with the Miller-Rabin primality test according to best known bounds.


ee also

*Strong Frobenius pseudoprime
*Ferdinand Georg Frobenius

External Links

* [ Symmetric Pseudoprimes] at MathPages

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Strong Frobenius pseudoprime — A strong Frobenius pseudoprime is a pseudoprime which obeys an additional restriction beyond that required for a Frobenius pseudoprime.External links*MathWorld|title=Strong Frobenius pseudoprime|urlname=StrongFrobeniusPseudoprime …   Wikipedia

  • Pseudoprime — A pseudoprime is a probable prime (an integer which shares a property common to all prime numbers) which is not actually prime. Pseudoprimes can be classified according to which property they satisfy.The most important class of pseudoprimes come… …   Wikipedia

  • Ferdinand Georg Frobenius — Infobox Scientist name = PAGENAME box width = image size =150px caption = PAGENAME birth date = October 26, 1849 birth place = Charlottenburg death date = August 3, 1917 death place = Berlin residence = citizenship = nationality = German… …   Wikipedia

  • Псевдопростое число — Натуральное число называется псевдопростым, если оно обладает некоторыми свойствами простых чисел, являясь тем не менее составным числом. В зависимости от рассматриваемых свойств существует несколько различных типов псевдопростых чисел.… …   Википедия

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

  • Nombre pseudopremier — Un nombre pseudopremier est un nombre premier probable (un entier qui partage une propriété commune à tous les nombres premiers) qui n est pas premier. Les nombres pseudopremiers peuvent être classés par rapport à la propriété qu ils satisfont.… …   Wikipédia en Français

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

  • Pequeño teorema de Fermat — Saltar a navegación, búsqueda …   Wikipedia Español