An algorithm to find multiple secret paths on MRNS networks by using the Hamiltonian Circuit Latin Square

Routing security is related to the confidentiality of the route taken by th e data transmitted over the network. If the route is detected by the advers ary, the probability is higher that the data are lost or the data can be in tercepted by the adversary. Therefore, the route must be protected. To acco mplish this, we select an intermediate node secretly and transmit the data. using this intermediate node, instead of sending the data, to the destinat ion node using the shortest path. Furthermore, if we use a number of secret routes from the starting node to the destination node, data security is mu ch stronger since we can transmit partial data rather than the entire data along a secret route, In this paper, the routing algorithm for multiple sec ret paths on MRNS (Mixed Radix Number System) Network, which requires O(l) for the time complexity where is the number of links on a node, is presente d employing. the HCLS (Hamiltonian Circuit Latin Square) and is analyzed in terms of entropy.