The search functionality is under construction.

The search functionality is under construction.

Routing security is related to the confidentiality of the route taken by the data transmitted over the network. If the route is detected by the adversary, the probability is higher that the data are lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to the destination 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 much stronger since we can transmit partial data rather than the entire data along a secret route. In this paper, the routing algorithm for multiple secret paths on MRNS (Mixed Radix Number System) Network, which requires *O*(*l*) for the time complexity where *l* is the number of links on a node, is presented employing the HCLS (Hamiltonian Circuit Latin Square) and is analyzed in terms of entropy.

- Publication
- IEICE TRANSACTIONS on Information Vol.E84-D No.8 pp.1048-1056

- Publication Date
- 2001/08/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- PAPER

- Category
- Applications of Information Security Techniques

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Seongyeol KIM, Ilyong CHUNG, "An Algorithm to Find Multiple Secret Paths on MRNS Networks by Using the Hamiltonian Circuit Latin Square" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 8, pp. 1048-1056, August 2001, doi: .

Abstract: Routing security is related to the confidentiality of the route taken by the data transmitted over the network. If the route is detected by the adversary, the probability is higher that the data are lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to the destination 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 much stronger since we can transmit partial data rather than the entire data along a secret route. In this paper, the routing algorithm for multiple secret paths on MRNS (Mixed Radix Number System) Network, which requires *O*(*l*) for the time complexity where *l* is the number of links on a node, is presented employing the HCLS (Hamiltonian Circuit Latin Square) and is analyzed in terms of entropy.

URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_8_1048/_p

Copy

@ARTICLE{e84-d_8_1048,

author={Seongyeol KIM, Ilyong CHUNG, },

journal={IEICE TRANSACTIONS on Information},

title={An Algorithm to Find Multiple Secret Paths on MRNS Networks by Using the Hamiltonian Circuit Latin Square},

year={2001},

volume={E84-D},

number={8},

pages={1048-1056},

abstract={Routing security is related to the confidentiality of the route taken by the data transmitted over the network. If the route is detected by the adversary, the probability is higher that the data are lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to the destination 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 much stronger since we can transmit partial data rather than the entire data along a secret route. In this paper, the routing algorithm for multiple secret paths on MRNS (Mixed Radix Number System) Network, which requires *O*(*l*) for the time complexity where *l* is the number of links on a node, is presented employing the HCLS (Hamiltonian Circuit Latin Square) and is analyzed in terms of entropy.},

keywords={},

doi={},

ISSN={},

month={August},}

Copy

TY - JOUR

TI - An Algorithm to Find Multiple Secret Paths on MRNS Networks by Using the Hamiltonian Circuit Latin Square

T2 - IEICE TRANSACTIONS on Information

SP - 1048

EP - 1056

AU - Seongyeol KIM

AU - Ilyong CHUNG

PY - 2001

DO -

JO - IEICE TRANSACTIONS on Information

SN -

VL - E84-D

IS - 8

JA - IEICE TRANSACTIONS on Information

Y1 - August 2001

AB - Routing security is related to the confidentiality of the route taken by the data transmitted over the network. If the route is detected by the adversary, the probability is higher that the data are lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to the destination 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 much stronger since we can transmit partial data rather than the entire data along a secret route. In this paper, the routing algorithm for multiple secret paths on MRNS (Mixed Radix Number System) Network, which requires *O*(*l*) for the time complexity where *l* is the number of links on a node, is presented employing the HCLS (Hamiltonian Circuit Latin Square) and is analyzed in terms of entropy.

ER -