Parallel Communications Using Pseudo Randomized Routing Algorthithms

スポンサーリンク

概要

• 論文の詳細を見る

• Routing security,a part of communication security,is the security of the route taken by the data while being transmitted over the network.If the route is known or is possibly detected by an adversary,it is then very likely that the data transferred over this route will be intercepted.For this reason,the route taken for transmission must be protected.To accomplish this,we propose an algebraic approach to the design of pseudo randomized routing algorithm.Later,the algorithm will be analyzed in terms of entropy.

• 社団法人電子情報通信学会の論文
• 1993-10-25

著者

• Lee C.w.

  Electronics And Telecommunications Research Institute

• Chung I.Y.

  Electronics and Telecommunications Research Institute

• Kim C.R.

  Electronics and Telecommunications Research Institute

関連論文

• Parallel Communications Using Pseudo Randomized Routing Algorthithms

スポンサーリンク