6 citations · 6 across the 1 of their papers we have counts for
1 paper · 1 filter
Gregor Leander
Given n=p*q with p and q prim and y in Z_{p*q}^*. Shor's Algorithm computes the order r of y, i.e. y^r=1 (mod n). If r=2k is even and y^k \ne -1 (mod n) we can easily compute a non…