I found the third RSA number that is used to eliminate collisions. I was
talking about the exponent which is a coprime to the modulus of the primes.
Apparently the exponent does not need to be a prime.
wiki page - key generation - step 4 : "Choose an integer e such that 1 < e <
λ(n) and gcd(e, λ(n)) = 1; that is, e and λ(n) are coprime.".
As long as every CA using this algorithm has a different exponent, then all
keys are guaranteed to be unique with the CA's.
Jon.
On Monday, August 26, 2019, 10:42:44 AM PDT, Seymour J Metz
<[email protected]> wrote:
RSA only involves two primes. See
https://en.wikipedia.org/wiki/RSA_(cryptosystem)
--
Shmuel (Seymour J.) Metz
http://mason.gmu.edu/~smetz3
________________________________________
From: IBM Mainframe Discussion List <[email protected]> on behalf of Jon
Perryman <[email protected]>
Sent: Saturday, August 24, 2019 4:29 PM
To: [email protected]
Subject: Re: vendor distributes their private key
I vaguely recall that there was a third prime number involved in the algorithm
that was static for RSA. Do they still have this third prime? Could it be that
they use this to eliminate this possibility?
Jon.
On Saturday, August 24, 2019, 09:17:22 AM PDT, Mike Schwab
<[email protected]> wrote:
> Well, keys are supposed to be two large prime numbers. Without a
> registry of which numbers have been used, it would be possible for two
> people to use the same prime number.
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: INFO IBM-MAIN
