#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2010

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Bartosz Zralek
- Math. Comput.
- 2010

In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard’s p−1 algorithm, which finds in random polynomial time the prime divisors p of an integer n such that p− 1 is smooth. We show that these prime factors can be recovered in deterministic… (More)

- Jacek Pomykala, Bartosz Zralek
- computational complexity
- 2012

The discrete logarithm problem modulo a composite—abbreviate it as DLPC—is the following: given a (possibly) composite integer n ≥ 1 and elements $${a, b \in \mathbb{Z}_n^*}$$ , determine an $${x \in \mathbb{N}}$$ satisfying a x = b if one exists. The question whether integer factoring can be reduced in deterministic polynomial time to the DLPC remains… (More)

- Konrad Durnoga, Bartosz Zralek
- Fundam. Inform.
- 2015

- Bartosz Zralek
- Math. Comput.
- 2010

Let an arbitrarily small positive constant δ less than 1 and a polynomial f with integer coefficients be fixed. We prove unconditionally that f modulo p can be completely factored in deterministic polynomial time if p− 1 has a (ln p)O(1)-smooth divisor exceeding pδ. We also address the issue of factoring f modulo p over finite extensions of the prime field… (More)

- ‹
- 1
- ›