Quote:
Originally Posted by Drdmitry
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 50digit primes?