 In context of the above material, what these latter authors have achieved is to find "N" much less than 23"k" + 1, so that "Z"/"NZ" has a (2"m")th root of unity.This speeds up computation and reduces the time complexity.However, these latter algorithms are only faster than Schönhage–Strassen for impractically large inputs.