Pollard's p − 1 algorithm
id:
pollard-s-p-1-algorithm-289-12848199
title:
Pollard's p − 1 algorithm
text:
Pollard's p − 1 algorithm is a number theoretic integer factorization algorithm, invented by John Pollard in 1974. It is a special-purpose algorithm, meaning that it is only suitable for integers with specific types of factors; it is the simplest example of an algebraic-group factorisation algorithm. The factors it finds are ones for which the number preceding the factor, p − 1, is powersmooth; the essential observation is that, by working in the multiplicative group modulo a composite number N,
brand slug:
wiki
category slug:
encyclopedia
description:
Special-purpose algorithm for factoring integers
original url:
https://en.wikipedia.org/wiki/Pollard%27s_p_%E2%88%92_1_algorithm
date created:
date modified:
2024-04-18T01:11:43Z
main entity:
{"identifier":"Q1937853","url":"https://www.wikidata.org/entity/Q1937853"}
image:
fields total:
13
integrity:
14