A secure routing scheme in MANET with CRT based secret sharing

Sharing of secret values in MANET is inconsistent and computationally insecure due to its dynamic nature. Over the years, key generation, encryption and decryption have evolved as important techniques for providing secure routing in MANETs. Many researchers are involved in solving the secret sharing problem. Shamir´s proposal is one of the eminent secret sharing schemes. However, this scheme does not include secure key generation. This paper proposes the use of the mathematical theory of Chinese remainder theorem coupled with the commonly used RSA for generating keys. Computational complexity of CRT is less than RSA modular exponentiation scheme. This helps to reduce the computational overhead. Once a secure key has been generated, it has been used for finding a secure route between source and destination. The final route is selected based on the highest weighted trust value of the routes. The three phased approach is aimed to increase the overall performance.