{'fraction_non_alphanumeric': 0.02843601895734597, 'fraction_numerical': 0.017061611374407582, 'mean_word_length': 4.834254143646409, '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}}
An Enhancement of Data Encryption Standards Algorithm (DES)

The Data Encryption Standard (DES) algorithm has been considered as the most popular symmetric key, blocks ciphering cryptographic. Even though the DES algorithm had still been used in some applications, it was considered unsafe because of the short key length (64 Bits), besides, the Brute force attack has shown that the DES practically can be attacked. In January 1999, the DES key was cracked in only (22 hours) and (15 minutes). The aim of this research is to improve the DES algorithm by increasing the key length (1024 bits) that is to be divided into 16 keys (64 bits each), each key is independently generated for the different algorithm cycles. The results of the proposed algorithm were much better than the old algorithm for detecting the encryption key or the total number of keys that could be generated by following Blind search method (try all possible keys), Increasing the key length (degree of complexity) makes it difficult to search in a vast space of numbers and attempts.