We illustrate in this part of the survey all theory and concept implementation in FPGA of the PRNG generators. An important property of all these generators is that they are special cases of a general class of generators whose state evolves according to a (matrix) linear recurrence modulo 2 and the bits that form the output are also determined by a linear transformation modulo 2 applied to the state. Except for the chaotic system where are dynamic and non linear PRNG. 

%%%% All Type of PRNG
%\subsection{F2-Linear Generator} 
\input{../PRNG/LFSR.tex}
 
\label{Blum Blum Shub} 
\input{../PRNG/BBS.tex} 

\label{Mastrine Tewister}
\input{../PRNG/Mastrine_Tewister.tex} 

\label{Cellular Automata} 
\input{../PRNG/Cellular_Automata.tex} 

\label{Chaotic Rundom Number Generator} 
\input{../Chaotic/Chaotic.tex}