{'fraction_non_alphanumeric': 0.008968609865470852, 'fraction_numerical': 0.0, 'mean_word_length': 5.2, '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 Routing Approach to provide Security in Wireless Networks

Wireless adhoc network is autonomous, infrastructure less and may be mobile depending on its type of application. Secure transmission of information in wireless adhoc environment is an important concern. In this paper we propose to use shared cryptography to secure message communication in adhoc network. In this approach we divide any information into multiple shares and transmit the different shares via multiple disjoint paths between any pair of communicating nodes and if possible at different point of time. At the receiving end the original information is reconstructed by combining the shares received via different paths at different point of time. We have also proposed to keep redundancy in the number of shares to withstand loss of some shares due to loss in transmission or security attacks. Compared to other available schemes, it has minimal computational complexity. That makes it more effective in energy saving distributed environment where battery driven low end processors are used and security is also a major challenge.