Use of Chinese Remainder Theorem to generate random numbers for cryptography

Random numbers are the numbers, which play an important role for various network security applications. hers are some techniques that are used to generating random numbers such as” pseudorandom number generator” and “linear congruent generator” also cryptographically generated random numbers” etc. but here we are using the Chinese Reminder Theorem for the purpose of generating Random numbers. In essence, CRT says it is possible to reconstruct integers in a certain range from their residues modulo a set of pair wise relatively prime modulo.