[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [iaik-jce] primes p and q for RSA ?

To RSA keypair generation algorithm was taken from CryptoBytes, Volume 3,
Number 1 to generate strong primes. The primality test is based on

 Andreas Sterbenz              mailto:Andreas.Sterbenz@iaik.at

----- Original Message -----
From: "Henrik Helleberg" <henrik.helleberg@student.uni-siegen.de>
To: "IAIK- Mailing List" <iaik-jce@iaik.at>
Sent: Thursday, November 30, 2000 6:47 PM
Subject: [iaik-jce] primes p and q for RSA ?

> Hello ,
> which algorithm use IAIK to find & generate the primes 'p' and 'q'  for
RSA (sign & verify)
> Thanks in advance,
> Henrik

Mailinglist-archive at

To unsubscribe send an email to listserv@iaik.at with the folowing content: