At 04:58 AM 8/6/04 -0700, Sarad AV wrote:
Since they are using symmetric keys, for a network of
'n' nodes, each node need to know the secret key that
they share with the remaining (n-1) nodes.Total number
of symmetric keys that need to be distributed is
[n*(n-1)]/2. Key management is harder when
hi,
Since they are using symmetric keys, for a network of
'n' nodes, each node need to know the secret key that
they share with the remaining (n-1) nodes.Total number
of symmetric keys that need to be distributed is
[n*(n-1)]/2. Key management is harder when they
network gets larger.
Sarath.
http://www.wired.com/news/print/0,1294,64464,00.html
Onion Routing Averts Prying Eyes
By Ann Harrison
Story location: http://www.wired.com/news/privacy/0,1848,64464,00.html
02:00 AM Aug. 05, 2004 PT
Computer programmers are modifying a communications system, originally
developed by the U.S.
