Chaotic PCG - A New Key Generation Algorithm Based on Chaotic Selection

Abstract

In today's internet world, where data is developing and growing rapidly, ensuring the security of the concept of big data has become an important study topic. One of the most basic functions required for cryptological encryption operations is random keys. Random number generators that will fulfill all the features required by the concept of randomness have not been developed yet. A new generator model has been developed by using a combination of permutation function and chaotic selection in order to adapt the statistically weak number sequences from the random number generators in the literature to the randomness theory. The performance of the random keys obtained as a result of this generator, called PCG (Per-muted congruential generator), on NIST tests has been examined. In line with the results obtained, it has been seen that the cryptological encryption keys produced from the chaotic selection-based PCG generator can be used in various fields.