[Cryptography Team] PrimesFinder using #atRandom

[luciano]

Regarding the tests, I'd rather keep them fast, so we can run lots of
them very often (after every change we make). If we have a test case
that never finishes, it'll keep us from running the rest of the test
suit. If we want to test for speed and make sure Squeak will generate
2048-bits keys in a reasonable amount of time, pehaps we should make a
test like this:

self assert: [(Time millisecondsToRun:[ElGamalKeyGenerator new
generateKeysOfSize: 128]) < 100]

or something similar, i.e making sure a small key is generated in a
very very short time. Does this make sense? What do you think?

Luciano

On 2/13/06, Chris Muller <chris at funkyobjects.org> wrote:
> Has anyone tried
>
>   ElGamalKeyGenerator new generateKeysOfSize: 2048
>
> ?
>
> The ElGamal tests pass because they use but a 15-bit
> key!  Does anyone mind if I beef up this test and
> possibly others?
>
> I can post notice of my commit here when I'm done and
> then someone else can review it if they want?  The
> tests will not pass unless we fix the issue itself.
>
> The issue itself appears to be caused by use of the
> Float-based "Random" generator.  I haven't yet tried
> replacing it with SecureRandom, but I will try that
> soon.
>
> _______________________________________________
> Cryptography mailing list
> Cryptography at lists.squeakfoundation.org
> http://lists.squeakfoundation.org/cgi-bin/mailman/listinfo/cryptography
>