Pollard p-1 factorization method
E2000703
UNEXPLORED
The Pollard p−1 factorization method is a number-theoretic algorithm that factors integers efficiently when one of their prime factors has a smooth p−1 value, making it useful in cryptanalysis and computational number theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Pollard p-1 factorization method canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.