Analytical Model for Secure Pairing in ad hoc Network

Abstract

Key pairing and enciphering heuristics must be free from complexity whereas amount of confidentiality directs the adaptability of encryption and decryption scheme because an extensive ciphertext requires extra space complexity and more communication time. Fast and secure authenticators are present in the literature. As compared to RSA, an elliptic curve in secure paring using smallest size of key is more efficient without sub-exponential attack on the Discrete Logarithmic problem. This paper focuses on analytical representation of different elliptic curves used in pairing of devices in ad-hoc network. BN, BLS and KSS curves are mostly used in the Elliptic cryptography systems. Assortment of an appropriate Hash function in elliptic curve and constraints for pairing has great impact on security level and complexity. Analytically proved the performance of BLS curve with different embedding degree in terms of computation time is fair enough.