Prime mod primes
 

I have a feeling my lack of maths knowledge is going to make me look stooopid, but see my post here:

[URL]http://mersenneforum.org/showpost.php?p=116756&postcount=20[/URL]

[B] Question.[/B]
Assuming the original prime is not trivially small is it possible to decode a code to calculate the prime that generated it?

(Actually calculate the prime from the individual digits of the code, not just calculate that it must be the xth prime because of the length of the code. Change it to binary if it's not hard enough!)

Edit: Or change it to base(original prime) if it's too hard.

This is not meant to be a puzzle, it's a 'is it possible and if so how' question.

Google "Chinese Remainder Theorem" aka CRT

Thank you.