{'fraction_non_alphanumeric': 0.009592326139088728, 'fraction_numerical': 0.0, 'mean_word_length': 5.231343283582089, '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 new elliptic curve cryptosystem for securing sensitive data applications

Enhancing security is the main intention for public key cryptosystems on the basis of the hardness of the obstinate computational problems. In this paper, the ASCII value depiction of the text message is mapped into a point on elliptic curve and this initiates a few order of complexity yet before the message is encrypted. Next, the process of encryption/decryption of a mapped elliptic curve point is illustrated by enhancing security using comparative linear congruential generator and then subjecting it to the knapsack algorithm. These steps introduce scrupulous confusion and diffusion to smash any attempt at brute force attacks. This paper also discusses the security aspects of the proposed cryptosystem which is secure against all kinds of attacks.