Skip to search formSkip to main contentSkip to account menu

Pollard's p − 1 algorithm

Known as: P1, Pollard's p-1 algorithm, Pollard p-1 Factorization Method 
Pollard's p − 1 algorithm is a number theoretic integer factorization algorithm, invented by John Pollard in 1974. It is a special-purpose algorithm… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
AlgorithmGreat Internet Mersenne Prime SearchInteger factorizationLenstra elliptic curve factorization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
ON DEGENERATE q-BERNOULLI POLYNOMIALS
In this paper, we introduce the degenerate Carlitz q-Bernoulli numbers and polynomials and give some interesting identities and… 
2013
2013
The p‐order of topological triangulated categories
The p‐order of a triangulated category is an invariant that measures ‘how strongly’ p annihilates objects of the form Y/p. In… 
2012
2012
Three problems in algebraic combinatorics
We consider three problems in algebraic combinatorics. The first one is related to spectral graph theory. Let λ1 ≥ · · · ≥ λn be… 
2010
2010
Stochastic power law fluids: Existence and uniqueness of weak solutions
We consider a SPDE (stochastic partial differential equation) which describes the velocity field of a viscous, incompressible non… 
2010
2010
EXPANSION OF ORBITS OF SOME DYNAMICAL SYSTEMS OVER FINITE FIELDS
Abstract Given a finite field 𝔽p={0,…,p−1} of p elements, where p is a prime, we consider the distribution of elements in the… 
Highly Cited
2007
Highly Cited
2007
On mod p properties of Siegel modular forms
We prove two results on mod p properties of Siegel modular forms. First, we use theta series in order to construct of a Siegel… 
2007
2007
List circular coloring of trees and cycles
Suppose G=(V, E) is a graph and p ≥ 2q are positive integers. A (p, q)‐coloring of G is a mapping ϕ: V → {0, 1, …, p‐1} such that… 
2007
2007
Improving Social Filtering Techniques Through WordNet-Based User Profiles
Collaborative filtering algorithms predict the preferences of a user for an item by weighting the contributions of similarusers… 
2004
2004
Multiple Testing Procedures for Controlling Tail Probability Error Rates
The present article discusses and compares multiple testing procedures (MTP) for controlling Type I error rates defined as tail… 
1999
1999
The maximum number of edges in a graph of bounded dimension, with applications to ring theory
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)