A deterministic version of Pollard's p-1 algorithm. - Bartosz Zralek (Math. Comput., 2010)

Using partial smoothness of p-1 for factoring polynomials modulo p. - Bartosz Zralek (Math. Comput., 2010)

On reducing factorization to the discrete logarithm problem modulo a composite. - Jacek Pomykala; Bartosz Zralek (Comput. Complex., 2012)

On Computing Discrete Logarithms in Bulk and Randomness Extractors. - Konrad Durnoga; Bartosz Zralek (Fundam. Informaticae, 2015)

An extension of a result about divisors in a residue class and its application to reducing integer factorization to computing Euler's totient. - Bartosz Zralek (Math. Comput., 2019)