Return to BSD News archive
Path: euryale.cc.adfa.oz.au!newshost.anu.edu.au!harbinger.cc.monash.edu.au!news.cs.su.oz.au!metro!metro!munnari.OZ.AU!news.ecn.uoknor.edu!solace!umdac!newsfeed.sunet.se!news00.sunet.se!sunic!nntp.coast.net!swidir.switch.ch!epflnews!not-for-mail
From: "Stefan Monnier" <stefan.monnier@lia.di.epfl.ch>
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 18:11:42 GMT
Organization: Ecole Polytechnique Federale de Lausanne
Lines: 13
Message-ID: <4i734u$9ik@info.epfl.ch>
References: <4gi6t6$3h9@lace.colorado.edu> <4hhp71$cv9@senator-bedfellow.MIT.EDU> <4hsun4$d3h@park.uvsc.edu> <4i4g8m$gms@hermes.synopsys.com>
NNTP-Posting-Host: liasg9.epfl.ch
Originator: monnier@lia.di.epfl.ch (Stefan Monnier)
Xref: euryale.cc.adfa.oz.au comp.os.linux.misc:91774 comp.os.linux.development.system:19321 comp.os.linux.networking:31639 comp.unix.bsd.bsdi.misc:2648 comp.unix.bsd.netbsd.misc:2463 comp.unix.bsd.freebsd.misc:15428
In article <4i4g8m$gms@hermes.synopsys.com>,
Joe Buck <jbuck@synopsys.com> wrote:
] But as long as only exponential algorithms are known, adding only
] one bit to the key length doubles the required effort. Massive
] parallelism doesn't help.
Let's go for some nit-picking: the required effort is probably not multiplied
by 2, but by a smaller "constant" (which still makes it exponential), or if you
prefer, you have to add more than 1 bit (but still a constant number of bits) to
multiply the required effort by 2.
Stefan