Random number generator design for cryptography-information security

Systems developed for cryptological purposes are increasing their importance day by day. On the other hand, random number generators have a wide field of study that has been going on since the existence of cryptology. In this thesis, both real and pseudo-random number generator designs to be used for cryptological purposes were realized and their success was tried to be measured with the help of various tests. In the beginning of the thesis study, different random number generator designs were carried out. True random number generators that need a physical signal are supported by pseudo random number generators in algorithmic structure. Physical signals are pretested with Lyapunov exponents and Hoshen-Kopelman algorithm. Later, the developed systems were tried to be verified with analyzes such as NIST statistical randomness tests, autocorrelation test, scale-index test. The random bit sequences obtained here are used for encryption processes with the help of existing encryption algorithms and the encryption algorithm that we advanced. The reliability of the encryption systems was investigated by applying different cryptanalysis methods such as histogram analysis, key sensitivity and key space analysis, NPCR and UACI test, entropy test, calculation of correlation coefficients. In this study, a new symmetric block cipher algorithm is designed with different true and pseudo random number generator designs that meet the security requirements. It has been shown that the random number generators we have developed can be used in cryptological applications by obtaining successful results from statistical tests. On the other hand, the developed symmetric block cipher algorithm, has been shown in our study to work faster than standard algorithms in encryption and decryption processes, as well as succeeding in security tests.