Cryptography Reference
In-Depth Information
Exercise 14.9.6
Show that if
N
is known to have a prime factor
p
≡
1(mod
m
)for
m>
2
x
m
then it is preferable to use the polynomial
f
(
x
)
=
+
1.
Exercise 14.9.7
Floyd's and Brent's cycle finding methods are both useful for the rho
factoring algorithm. Explain why one cannot use the other cycle finding methods listed
in Section
14.2.2
(Sedgewick-Szymanski-Yao, Schnorr-Lenstra, Nivasch, distinguished
points) for the rho factoring method.
