home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!uknet!tlg
- From: tlg@uknet.ac.uk (Tim.Goodwin)
- Newsgroups: alt.hackers
- Subject: Re: Prime Number Generator
- Message-ID: <1381@uknet.ac.uk>
- Date: 3 Sep 92 10:22:56 GMT
- References: <1992Aug31.160225.26724@gateway.novell.com> <3756@randvax.rand.org> <1992Sep1.132304.20355@jarvis.csri.toronto.edu>
- Organization: UKnet
- Lines: 29
- Approved: no-room@the.inn
-
- In article <1992Sep1.132304.20355@jarvis.csri.toronto.edu>
- flaps@dgp.toronto.edu (Alan J Rosenthal) writes:
- >jim@rand.org (Jim Gillogly) writes:
- >>The whole idea beind RSA encryption is that large prime numbers are *easy* to
- >>prove prime,
- >
- >Running a probabilistic algorithm does not yield a proof that they're prime.
-
- No, but with a bit of care you can make a probabilistic algorithm more
- reliable than the machine you're running it on.
-
- ObHack: arguments to uux often have parentheses. rsh uses the shell.
- Parentheses are shell metacharacters. So
-
- rsh host /usr/bin/uux "$@"
-
- won't work. I came up with two solutions (or rather one solution
- expressed in two different ways).
-
- [sh]
- rsh host /usr/bin/uux `echo "$@" '' |sed "s/\([^ ]*\) /'\1' /g"`
-
- [rc]
- rsh host /usr/bin/uux '''' ^ $* ^ ''''
-
- Tim.
- --
- perhaps if people had understood fork() better we | ; who am i
- wouldn't have threads - Rob Pike. | uknet.ac.uk!tlg
-