{'fraction_non_alphanumeric': 0.014375561545372867, 'fraction_numerical': 0.0017969451931716084, 'mean_word_length': 5.919254658385094, '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}}
Optimised elliptic curve digital signature on NIST compliant curves for authentication of MANET nodes

Secure routing protocols for mobile ad hoc networks (MANETs) use digital signatures for authentication which increases computational and communication overheads. Elliptical curve digital signature (ECDSA) uses much shorter keys resulting in smaller signatures, lower computational load, less memory and power requirements which are crucial to MANET nodes. The ECDSA has a characteristic that the signature generation is very fast but signature verification takes much longer time. Optimisation of point operations and scalar multiplication of points have been proposed for accelerating the signature generation and verification process. The proposed method has been software implemented by writing the code in Java using Big-integer class on a Linux platform for National Institute of Standards and Technology (NIST) compliant curves and has accelerated the signature verification process of ECDSA by approximately 27% over the sequential mixed Jacobian-Affine NAF scalar multiplication method of verification.