Re: DSA keys g parameter

H.K. Kingston-Smith <HKK-S@xxxxxxxxx> wrote:
I notice that the moduli file delivered with OpenSSH contains a
list of safe primes such that the generator is a small integer. How were
those safe primes derived so that the associated generator is that small?

For safe primes (p = 2q+1, q prime), half of all non-zero elements have
order q, and a few guesses should suffice if 4 is somehow unwanted.

--
Kristian Gjøsteen
.

Relevant Pages

  • Re: looking at Diffie Hellman
    ... generator for the prime. ... These are so-called safe primes. ... ArbInt randomPrime { ...
    (sci.crypt)
  • Re: generators be bound
    ... According to the folk here that's not a generator. ... prime order sub-group of the multiplicative sub-group of Z/pZ for some safe ... There is the multiplicative sub-group which is generate [not ... multiplicative sub-group of Z/pZ for safe primes. ...
    (sci.crypt)
  • Re: looking at Diffie Hellman
    ... | If you just want straight DH look for safe primes and just use 4 as your ... I thought that you should strive to make your generator on a ... 13 - in base 10) and then strives to find a generator that will satisfy the ... base/prime for each key - this would break diffie hellman. ...
    (sci.crypt)
  • Re: looking at Diffie Hellman
    ... > optimized) and then find a generator that fits the formula of: ... > a generator that would be suitable for a prime number of 1024 bits. ... Well I have a list of safe primes in LibTomMath ... A good generator is just a base which generates a large prime order group. ...
    (sci.crypt)
  • Re: DSA keys g parameter
    ... list of safe primes such that the generator is a small integer. ... and a few guesses should suffice if 4 is somehow unwanted. ... The DSA primes are not safe primes then? ...
    (sci.crypt)