Can the Shanks algorithm for discrete logarithm problem (baby-step/giant-step) be used for composite orders?
According to Wiki, "Usually the baby-step giant-step algorithm is used for groups whose order is prime. If the order of the group is composite then the Pohlig–Hellman algorithm is more efficient."
Is the above statement true? I have been trying to understand why the Shanks algorithm may not be used for composite orders, but I have not been able to figure out the reason.