N T ] 1 3 Se p 20 07 A deterministic version of Pollard ’ s p − 1 algorithm

@inproceedings{Lek2009NT,
  title={N T ] 1 3 Se p 20 07 A deterministic version of Pollard ’ s p − 1 algorithm},
  author={Bartosz´zra Lek},
  year={2009}
}
  • Bartosz´zra Lek
  • Published 2009
We present a deterministic version of Pollard's p − 1 integer fac-toring 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 point out two large classes of integers n (almost all) that have simple arithmetic characterization in terms of multiplicative structure and are completely factorable in deterministic polynomial time if ϕ(n) is given and… CONTINUE READING
0 Citations
3 References
Similar Papers

Similar Papers

Loading similar papers…