In Python RSA broadcast attack, why am I using bit length in this binary search for the cube root?
In Python RSA broadcast attack, why am I using bit length in this binary search for the cube root? Question: https://stackoverflow.com/a/23622115/9481613 Shows this function: def find_cube_root(n): lo = 0 hi = 1 << ((n.bit_length() + 2) // 3) while lo < hi: mid = (lo+hi)//2 if mid**3 < n: lo = mid+1 else: hi = …