METHODS FOR GENERATING KEYS FOR SYMMETRIC ENCRYPTION ALGORITHMS AND THEIR ANALYSIS

This article presents a classification and analysis of algorithms for generating random and pseudo-random numbers used in key generation for symmetric encryption systems. A comparative study has led to the development of an improved key generation method, addressing the limitations of existing algorithms. The analysis focuses on the cryptographic strength of pseudo-random number generators (PRNGs) and their application in symmetric and asymmetric cryptosystems, emphasizing the importance of randomness testing.