RE: Intel announcements at RSA '99

New Message Reply About this list Date view Thread view Subject view Author view

James Nerlinger, Jr. (jnj@ais-bbs.org)
Sun, 24 Jan 1999 00:25:21 -0500


I've watched this discussion with some interest and thought I'd post
briefly....

> Given that it passes DIEHARD randomness tests, I'll make the claim that
> there is no compressor which can find an algorithm which could reduce the
> number of equivalent bits from a hardware random bit generator. You
> might be able to build a fractal engine which might replicate the stats
> tests and look pretty damn close to the original signal. You are correct
> tho, I only tried a couple of compressors.

>From the paranoiac perspective (and a valid one in this particular instance)
I can think of a single key issue to this debate. Say that no known
compressor can find the theoretical algorithm (if it exists). This all fine
and well. However, if the proverbial big brother has the inside scoop on
the algorithm then finding it is a moot issue. There's nothing to say that
it isn't long / complex enough in structure but yet quite finite in nature.
Good enough for government work, or so they say.... :)

James


New Message Reply About this list Date view Thread view Subject view Author view

 
All trademarks and copyrights are the property of their respective owners.

Other Directory Sites: SeekWonder | Directory Owners Forum

The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:18:05