Presentation 1993/10/25
Parallel Communications Using Pseudo Randomized Routing Algorthithms
I.Y. Chung, C.R. Kim, C.W. Lee,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Shannon Theory / Rate-Distortion Theory / Cipher System
Paper # ISEC93-48
Date of Issue

Conference Information
Committee ISEC
Conference Date 1993/10/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Parallel Communications Using Pseudo Randomized Routing Algorthithms
Sub Title (in English)
Keyword(1) Shannon Theory
Keyword(2) Rate-Distortion Theory
Keyword(3) Cipher System
1st Author's Name I.Y. Chung
1st Author's Affiliation Electronics and Telecommunications Research Institute()
2nd Author's Name C.R. Kim
2nd Author's Affiliation Electronics and Telecommunications Research Institute
3rd Author's Name C.W. Lee
3rd Author's Affiliation Electronics and Telecommunications Research Institute
Date 1993/10/25
Paper # ISEC93-48
Volume (vol) vol.93
Number (no) 295
Page pp.pp.-
#Pages 10
Date of Issue