View Single Post
Old 2015-09-08, 15:47   #2
R.D. Silverman
R.D. Silverman's Avatar
Nov 2003

1D2416 Posts

Originally Posted by Drdmitry View Post
Given an irreducible polynomial P(x) with integer coefficients, is there any reasonable algorithm known, which constructs a random n such that P(n) is a product of two huge prime factors of relatively same size?
I know how to do that for quadratic polynomials.
??? algorithm that constructs a random n ?????
If n is constructed by an algorithm, then it isn't random......

Please tell us how you do it for quadratics.

For example: P(x) = x^2 - x + 1. How does one find n such that one knows, a priori that P(n) is (say) the product of two 50-digit primes?

Last fiddled with by R.D. Silverman on 2015-09-08 at 15:49
R.D. Silverman is offline   Reply With Quote