- #1

- 1,030

- 4

Given [itex]pq[/itex] where [itex]p < q[/itex] are prime, but either ([itex]p \equiv 1 \mod 4[/itex] and [itex]q \equiv 3 \mod 4[/itex]) or ([itex]p \equiv 3 \mod 4[/itex] and [itex]q \equiv 1 \mod 4[/itex]).

Is there a ppt algorithm that will distinguish the two possibilities?

Is there a ppt algorithm that will distinguish the two possibilities?

Last edited: