{'fraction_non_alphanumeric': 0.016333938294010888, 'fraction_numerical': 0.0, 'mean_word_length': 5.196629213483146, '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 Efficient Elliptic Curve Digital Signature Algorithm (ECDSA)

In recent years, Elliptic Curve Cryptography (ECC) has attracted the attention of researchers and product developers because of its robust mathematical structure and highest security in comparison to other existing algorithms like RSA (Rivest Adleman and Shameer Public key Algorithm). Elliptic Curve Digital signature represents one of the most widely used security technologies for ensuring un-forge-ability and non-repudiation of digital data. Its performance heavily depends on an operation called point multiplication. Furthermore, root cause of security breakdown of ECDSA is that it shares three points of the elliptic curve public ally which makes it feasible for an adversary to gauge the private key of the signer. In this paper we proposed a new ECDSA which involves not as much of point multiplication operations as in existing ECDSA and shares only two curve points with everyone. The proposed method also reduces the point addition and point doubling operations. It is found to be more secure in contrast to existing ECDSA.