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… 
2010
2010
Antimutagenicity and Anti-HSV-2 Activity of Mulberry Tea (Morus rotunbiloba Koidz)
Hot water extract from mulberry leaves, Morus rotunbiloba Koidz was extracted with diethyl ether, and its components were… 
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… 
2005
2005
Reliability in Single, Double and N2R Ring Network Structures
— This paper studies the properties of single, double and N2R ring network structures during link errors. The structure of the… 
2004
2004
Stream cipher based on quasigroup string transformations in Zp*
In this paper we design a stream cipher that uses the algebraic structure of the multiplicative group $\bbbz_p^*$ (where p is a… 
2001
2001
Cauchy Problem and Initial Trace for a Doubly Degenerate Parabolic Equation with Strongly Nonlinear Sources
where p > 1 m > 0, m p − 1 > 1, q > 1 N ≥ 1, and u0 ∈ Lloc R . Equation (1.1) has been suggested as a mathematical model for a… 
2001
2001
On the connectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices is partitioned in p parts that are cyclically ordered in such a way that… 
1999
1999
The maximum number of edges in a graph of bounded dimension, with applications to ring theory
1994
1994
Couponing Scheme Reduces Computational Power Requirements for DSS Signatures
This paper introduces the new concept of ’use & throw’ DSS authentication coupons. An authentication coupon is a couple of… 
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)