{'fraction_non_alphanumeric': 0.009083402146985962, 'fraction_numerical': 0.0, 'mean_word_length': 5.733333333333333, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Diffusive primitives in THE design of modern cryptographic algorithms

The importance of data confidentiality, integrity and availability in any data storage and transmission is undeniable especially with the development of highly integrated communication mediums such as the Internet. Disclosure of confidential or secret data to unauthorised users has become an important issue and indirectly give opportunity for ongoing research and development for reliable and strong cryptographic algorithms. Every modern cryptographic algorithm must have the elements of confusion and diffusion in it design. Research on finding effective and efficient diffusive element is still ongoing and highly discussed amongst researchers in the area of information security. In this paper, we investigate the diffusive property of three cryptographic algorithms: Rijndael, Twofish and Safer+ using a simple test vectors. Binary and decimal representation will be used to show the characteristic of each diffusive that play an important role as it will ensure any ciphertext generated from cryptographic algorithm are random and free from any predicted pattern which might be used by cryptanalyst to decipher the original message.