Random or pseudo-random binary sequences are essential to various branches of science, such as cryptography, simulation, and mathematics. These values are obtained through the use of random or pseudo-random binary generators. These random strings must have a high period and high linear complexity, and must pass statistical randomness tests, to ensure their effectiveness. The development of a generator must take all of the above factors into account, and each step of the process must be meticulously controlled to ensure a satisfactory final result. Combining cryptographic components can result in an unsuitable generator. This project describes the methodology for developing a reliable binary generator. The basic components of the generator proposed in this presentation are Self-Shrinking Generators and Modified Self-Shrinking Generators, which are combined using four-variable Boolean functions.