How to implement a Cryptographic Pseudo Random Function I need three pseudo random functions which all take  a 
seed S (t-bits long). 

The functions should map from 


$d$ bits to $d$ bits
$d$ bits to $1$ bit
$d$ bits to $t$ bits


$d$ is $10$ bits
$t$ is $2048$ bits

Can you link me to some c++ implementation(or any language) or tell me how to implement it?
$f_s: d \rightarrow d$ bits is a Pseudorandom Permutation  (see Luby-Rackoff Constructions)
$f_s: d \rightarrow 1$ bit is a Hardcore bit (see Goldreich Levin Theorem)
$f_s: d \rightarrow t$ bits is a Pseudorandom Generator. (assuming $t$ is a function of $d$)  (see Goldreich Goldwasser Micali)


(All these topics are coved in the Katz-Lindell book.) 

With these constructions known, you'll be writing provably secure constructions for the crypto primitives.

Also, please forgive my abuse of notation here, when i write $f_s: x \rightarrow y$, what I really mean is $f: x \times s \rightarrow y$