From: gtoal@an-teallach.com (Graham Toal)
To: cypherpunks@toad.com
Message Hash: 138764c9e18dff6d8e7b9c0af0b9db0ba383c9d8d6e77db8a02ad3087c060144
Message ID: <199407272006.VAA07358@an-teallach.com>
Reply To: N/A
UTC Datetime: 1994-07-27 20:07:45 UTC
Raw Date: Wed, 27 Jul 94 13:07:45 PDT
From: gtoal@an-teallach.com (Graham Toal)
Date: Wed, 27 Jul 94 13:07:45 PDT
To: cypherpunks@toad.com
Subject: Re: Cryptosplit note
Message-ID: <199407272006.VAA07358@an-teallach.com>
MIME-Version: 1.0
Content-Type: text/plain
It uses rand() when it needs random numbers for the
coefficients of the polynomial. I don't know what kind of
security risk that poses, but it really should be using something
better.
It definitely should. It will be trivially crackable. (Well, trivally
after someone writes the program I mean, which is more tedious than
difficult).
(Next question to determine *how* tedious... what do you do to initialise
the random sequence? - oh, never mind, I should look at the code, except
it's probably not worth the effort now. Just make sure people only
use it for fun and not serious data hiding. Ask on sci.crypt if anyone
wants to take a crack at decrypting the exored data, given the source
code.)
Where can I get Blum-Blum-Shub source or documentation on the
algorithm?
Can't help on that one, sorry. They don't tell us nasty furriners.
g
Return to July 1994
Return to “gtoal@an-teallach.com (Graham Toal)”
1994-07-27 (Wed, 27 Jul 94 13:07:45 PDT) - Re: Cryptosplit note - gtoal@an-teallach.com (Graham Toal)