{'fraction_non_alphanumeric': 0.0128099173553719, 'fraction_numerical': 0.0008264462809917355, 'mean_word_length': 4.764285714285714, '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}}
Unbreakability of Encryption & DLT Standard

Cryptography is taught with the basic rule that there is no such thing as an unbreakable encryption because "If someone tries enough keys he is bound to get the right one," which gives rise to the basis of the brute force attack. Brute force attack, or exhaustive key search, is a strategy that can, in theory, be used against any encrypted data. It involves systematically checking all possible keys until the correct key is found. One of the measures of the strength of an encryption system is how long it would theoretically take an attacker to mount a successful brute-force attack against it. The so-called Landauer limit implied by the laws of physics sets a lower limit on the energy required to perform a computation of kT and the processing speed and memory requirements also set physical barriers. But with the exponential growth of computing industry supercomputers having computing capacities of 20 Peta-FLOPS and beyond have been made and a number of systems that were originally thought to be impossible to crack by brute force have nevertheless been cracked. A truly unbreakable code must not have an obtainable key. A theory for this is for the code breaker to not realize that he has broken the code even if he has the key. For example, the key and cleartext may change according to a random time variable so that even when the code has been broken the encrypted text could still represent any other meaning. This is however very impractical and has never been able to be put into effect. This paper discusses unbreakability of encryptions and proposes an encryption that can be called truly unbreakable. This paper also discusses a way of implementing an encryption that is contextually breakable and hence can only be used by random common users not criminals and terrorists because for them the code can be broken. Modern world is moving towards cyber globe. In an era where meetings, conversations, decision making, information sharing and even social aspects of life are moving online and offline on digital and cyber world, it is necessary to provide for security and privacy on cyber and digital world which is provided cryptography. The world of cryptography has come from historic roots where cryptography was a physical world phenomenon with no particular definition except communication with codes. In the modern era the cryptographic scenario has