{'fraction_non_alphanumeric': 0.008504606661941885, 'fraction_numerical': 0.0, 'mean_word_length': 4.983050847457627, '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}}
A proposed approach for the key generation in cryptography to enrich the data confidentiality while sharing data over the network

Data sharing over network has been threat in the digital world. To provide the security to the data being passed over the network various system has been defined. Most widely used systems are cryptography and steganography. Cryptography is the art of converting the data to some another format which will not be understandable by the intruders. The most important phase while sharing data over network using cryptography is the key generation and key distribution. General cryptography techniques either uses public key or uses public and private key both. The major focus of the propose method is not to commute keys with the data being shared over network. Proposed approach defines a method which will get feedback from the receiver and system will identify whether the receiver is undeniable or not. If the receiver is undeniable then only the data will be decrypted to the original to the original format. In this paper we have surveyed many traditional algorithms related to symmetric key and asymmetric key cryptography. Many mathematical operations are being applied to generate the complex keys to ensure security. This approach defines the complexity with almost no mathematical complexity and using no traditional approach for the key generation which are widely known.