A deterministic version of Pollard ’ s p − 1 algorithm

@inproceedings{lek2009ADV,
  title={A deterministic version of Pollard ’ s p − 1 algorithm},
  author={Bartosz Źra lek},
  year={2009}
}
  • Bartosz Źra lek
  • Published 2009
We give a deterministic version of Pollard's p − 1 integer factoring algorithm. More precisely, we prove that the integers factorable (partially or completely) in random polynomial time by the p− 1 algorithm are in fact factorable in deterministic polynomial time. We also give a simple arithmetic characterization (in terms of multiplicative structure) of a large class of integers n (almost all) that can be factored in deterministic polynomial time if φ(n) is given and (partially) factored… CONTINUE READING