METHODS FOR GENERATING KEYS FOR SYMMETRIC ENCRYPTION ALGORITHMS AND THEIR ANALYSIS
Keywords:
Pseudo-random keys, encryption, cryptographic strength, key generation, symmetric encryption, randomness testing.Abstract
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.
References
1. Decree of the President of Uzbekistan, “On Additional Measures to Protect National Information Resources,” No. PQ-1572, July 8, 2011.
2. Law of the Republic of Uzbekistan, “On Informatization,” No. 560-II, December 11, 2003.
3. Decree of the President of Uzbekistan, “On Additional Measures to Ensure Computer Security of National Information and Communication Systems,” September 5, 2005.
4. Resolution of the Cabinet of Ministers of Uzbekistan, “On Licensing the Design, Production, Sale, Repair, and Use of Cryptographic Protection Tools,” November 21, 2007.
5. Decree of the President of Uzbekistan, “On Measures to Further Introduce and Develop Modern Information and Communication Technologies,” No. QP-1730, March 21, 2012.
6. Uz DSt 1092:2009, “Information Technology. Cryptographic Protection of Information. Processes for Forming and Verifying Digital Signatures.”
7. Uz DSt 1105:2009, “Information Technology. Cryptographic Protection of Information. Data Encryption Algorithm.”
8. Uz DSt 1106:2009, “Information Technology. Cryptographic Protection of Information. Hash Function.”
9. Uz DSt 1109:2013, “Information Technology. Cryptographic Protection of Information. Terms and Definitions.”
10. Uz DSt 1204:2009, “Information Technology. Cryptographic Protection of Information. Security Requirements for Cryptographic Modules.”
11. Jain, R. (2010). Testing Random-Number Generators. www.rajjain.com.
12. Ferguson, N., & Schneier, B. (2005). Practical Cryptography.
13. Gernhardt, B. (2010). Cryptographic PseudoRandom Numbers. Rochester Institute of Technology, Cryptography II.
14. Smith, R. E. (2013). Information Security.
