*BSD News Article 63471


Return to BSD News archive

Path: euryale.cc.adfa.oz.au!newshost.anu.edu.au!harbinger.cc.monash.edu.au!bunyip.cc.uq.oz.au!munnari.OZ.AU!news.hawaii.edu!ames!usenet.kornet.nm.kr!news.kreonet.re.kr!usenet.seri.re.kr!news.cais.net!news.jsums.edu!gatech!swrinde!sgigate.sgi.com!sdd.hp.com!hamblin.math.byu.edu!park.uvsc.edu!usenet
From: Terry Lambert <terry@lambert.org>
Newsgroups: comp.os.linux.misc,comp.os.linux.development.system,comp.os.linux.networking,comp.unix.bsd.bsdi.misc,comp.unix.bsd.netbsd.misc,comp.unix.bsd.freebsd.misc
Subject: Re: need secure OS to entrust millions to
Date: 13 Mar 1996 01:58:43 GMT
Organization: Utah Valley State College, Orem, Utah
Lines: 27
Message-ID: <4i5a4j$ggt@park.uvsc.edu>
References: <4gi6t6$3h9@lace.colorado.edu> <1996Feb25.152559.8977@jarvis.cs.toronto.edu> <4gvchb$ln5@senator-bedfellow.MIT.EDU> <4h7rdd$qeu@park.uvsc.edu> <4hi93v$qas@keltia.freenix.fr> <4hsv73$d3h@park.uvsc.edu> <Do45Gu.1y@giskard.demon.co.uk>
NNTP-Posting-Host: hecate.artisoft.com
Xref: euryale.cc.adfa.oz.au comp.os.linux.misc:91528 comp.os.linux.development.system:19260 comp.os.linux.networking:31527 comp.unix.bsd.bsdi.misc:2635 comp.unix.bsd.netbsd.misc:2450 comp.unix.bsd.freebsd.misc:15380

dale@giskard.demon.co.uk (Dale Shuttleworth) wrote:
] Then there are very few systems where the search space cannot be
] determined (I can't think of any - if there are, they would have
] some rather interesting characteristics).  You seem to be saying
] that DES, IDEA, RSA and even the one time pad are all alogrithms
] which rely on security through obscurity.

No, actually I wouldn't include the one time pad.

Actually, my point was that RSA is not "security through secrecy";
if we want to "get real", 
 
] Your argument is quite irrefutible if you don't use the meaning
] usually attached to "security through obscurity".

Actually, my point was that RSA is not "security through secrecy";
if we want to "get real", it's security through an assumption of
computational difficulty.  And that assumes that you are better
at computing (in the calculation sense) than your opponent.



                                        Terry Lambert
                                        terry@cs.weber.edu
---
Any opinions in this posting are my own and not those of my present
or previous employers.