# Re: Just a question about benchmarking

Jan Luehe (Jan.Luehe@Eng)
Mon, 11 May 1998 17:18:59 -0700 (PDT)

- Messages sorted by: [ date ][ thread ][ subject ][ author ]
- Next message: Marianne Mueller: "Re: JCE 1.2"
- Previous message: Jan Luehe: "Re: JCE and APPLET"
- Maybe in reply to: Emmanuel Poitier: "Just a question about benchmarking"

    Date: Mon, 11 May 1998 17:18:59 -0700 (PDT)

    From: Jan Luehe <Jan.Luehe@Eng>

    Subject: Re: Just a question about benchmarking

    To: java-security@web2.javasoft.com, e_poitier@hotmail.com

Emmanuel:

> I just have a question. When you use the DSA algorithm generation key,
> for 512,768 and 1024 bits , default parameters are used, so for these
> the generation key is very fast. I just want know how many time (about)
> it's necessary to generate a 128 bits with DSA in Java. I do it with
> javakey, but I was boring to wait.

There are no 128 bit DSA keys.
The prime modulus p must be L bits long, where L ranges from 512 to 1024
and is a multiple of 64.

JDK 1.1.x (and therefore "javakey") did not check the user specified
modulus size. You are probably running in an endless loop.

JDK 1.2 applies those checks, and throws an exception if the user-
specified modulus size does not meet the above requirements.

Jan

- Next message: Marianne Mueller: "Re: JCE 1.2"
- Previous message: Jan Luehe: "Re: JCE and APPLET"
- Maybe in reply to: Emmanuel Poitier: "Just a question about benchmarking"