Given that modular multiplication is efficient, why isn’t the calculation of factorial mod N (N with unknown factors) computationally efficient?
SupportExpert
Given that modular multiplication is efficient, why isn’t the calculation of factorial mod N (N with unknown factors) computationally efficient?
Share