View Single Post
Old 2019-09-28, 19:28   #2
R.D. Silverman
R.D. Silverman's Avatar
Nov 2003

26×113 Posts

Originally Posted by baih View Post
Choose two large distinct prime numbers p and q

p = prime
q = prime

Compute c=pq

such that:
c=3 Mod 4

(c +1)/4) = 1 Mod (p-1)

there exist a Quick way of finding p and q from c

Can someone please propose a number ( c )

Examples are easy to find. Infinitely many, in fact.

Let c = 3q, q = 1 mod 8. Try e.g. c = 51
R.D. Silverman is offline   Reply With Quote