Symmetric random function generator (SRFG): A novel cryptographic primitive for designing fast and robust algorithms

Cryptanalysis analyses various combinations among plaintexts, ciphertexts and random keys; even using differential methods or analog methods, the attackers can interpret the keys depending upon the operations in the round functions or any subset of the algorithm. The previous research emphasizes on creation of different cryptographic functions, however the randomness of such functions has not been researched significantly so far. In this paper, we have shown a random function generator which can be used for any cryptographic algorithm. This generator outputs the combination of functions in random and cannot be traced back due its randomness. The objective of our research work is not to identify a particular boolean function that is balanced or symmetric based on its input variables, our proposed work provides a random combination of generic boolean functions as used in MD5 or SHA series, block cipher round functions and stream ciphers. Moreover, the random selection of input variables for a particular function also makes it desirable for cryptographic function modules. The results of our experimentation show that the functions generated by the proposed generator provide a good non-linearity, resiliency and balanced effect.