Xref: utzoo sci.crypt:1447 comp.unix.wizards:13803 news.sysadmin:2025
Path: utzoo!attcan!uunet!mcvax!unido!altger!vyrus
From: vyrus@altger.UUCP (vyrus)
Newsgroups: sci.crypt,comp.unix.wizards,news.sysadmin
Subject: Re: Yet Another useful paper
Message-ID: <1273@altger.UUCP>
Date: 1 Jan 89 23:18:15 GMT
References: <11013@ulysses.homer.nj.att.com> <2308@cuuxb.ATT.COM> <4420@xenna.Encore.COM> <2743@epimass.EPI.COM> <110@microsoft.UUCP>
Reply-To: vyrus@altger.UUCP (vyrus)
Organization: Altos Computer Systems Munich
Lines: 18

I have heard about a paper presenting a mathematical formulation of a fast
implementation of the DES in software able of speding up UNIX crypt()
password encryption routine by roughtly 20 times. (@ulysses.homer.nj.att.com)

I wonder if someone would mind telling more about the matter or, (even better!)
sending me an high language (C? great!) implementation of such algorithm.

Another thing: I tried for over a month to design in C a decent pseudo
random generator, but in vain. I know there is a lot a theory about
random generators, but where are the samples? Now I am using DES to generate
pseudo randomness and the process is terribly slooow. Any hints?

[well, I did succeeed in writing my program, but when I applied its output
to David Wood's Random_Number_Generator_Tester.c I found it was too bad]

Thanks in advance.

=David=