In wireless adhoc networks, all nodes are mobile and can be connected dynamically in an arbitrary manner for packet type communications. All nodes behave as routers and take part in discovery and maintenance of routes to other nodes in the network. In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already proposed, they are not efficient, in the sense that, they use the same kind of encryption algorithms for every bit of routing information they pass from one intermediate node to another in the routing path. This consumes lot of energy or power as well as time. Our routing algorithm basically behaves depending upon the trust one node has on its neighbor. The trust factor and the level of security assigned to the information flow decide what level of encryption is applied to the current routing information at a source or intermediate node. In other words, above a certain level of trust level, there is no need for the source or intermediate node to perform high level encryption on the routing information as it completely trusts the neighboring node. So based on level of trust factor, the routing information will be low-level, medium level, high level encrypted, the low-level being normal AODV. This not only saves the nodes power by avoiding unnecessary encoding, but also in terms of time, which is very much valuable in cases of emergencies where the information is as valuable as the time.