Recall Wiener's attack and how it exploits small private exponent \( d \) to factorize \( N \) using continued fractions.

Consider the relationship between \( d \), \( e \), and \( \phi(N) \), and how bounding \( d \) can lead to solving for \( \phi(N) \) via lattice-based methods (e.g., Coppersmith's attack).

Explore the Boneh-Durfee attack, which improves upon Wiener's by using lattice reduction techniques to handle slightly larger \( d \) values, and analyze its time complexity constraints.