Re: Geiger and long, unreadable lines

Dimitri Vulis <dlv@bwalk.dm.com> writes on cpunks-flames:
btw Dimitri, a crypto question: Diffie-Hellman key generation, there are two main ways of generating the diffie-hellman prime modulus, method 1: p = 2q+1 where q is a prime also. And method 2: p = r.2q+1 where q is a prime and r is a randomly generated number. With method 1, the security parameter is the size of p in bits (or size of q, as they are related). With method 2, there are two security parameters, size of q and size of p in bits. Method 2 has the advantage that key generation is faster as it is quicker to generate new random numbers r, than to repeatedly generate trial prime q as you have to do in method 1. However is the security weaker in method 2? What size of p and q do you have to use to get the same security as for same size of p in bits as in method 1? What should be the relationship between the size of p and q? (this isn't cpunks, this is cpunks-flames, so your non-crypto pledge shouldn't hold, besides Sandy has a stated policy of killing the whole thread, so I thought it amusing to continue your crypto relevance in moving on to technical topics rather than political) Adam -- print pack"C*",split/\D+/,`echo "16iII*o\U@{$/=$z;[(pop,pop,unpack"H*",<> )]}\EsMsKsN0[lN*1lK[d2%Sa2/d0<X+d*lMLa^*lN%0]dsXx++lMlN/dsM0<J]dsJxp"|dc`

Adam Back <aba@dcs.ex.ac.uk> writes:
My advice is to stay clear of any cryptosystem that relies on factoring being hard. I'll send you pointers to some very interesting new work based on the zeta function in private e-mail when I dig it up (please remind me if/when I forget this promise). I'm reluctant to say anything crypto-relevant on this defunct mailing list because last time I did, the moderator repeatedly cited it as evidence that his moderation works. --- Dr.Dimitri Vulis KOTM Brighton Beach Boardwalk BBS, Forest Hills, N.Y.: +1-718-261-2013, 14.4Kbps
participants (2)
-
Adam Back
-
dlv@bwalk.dm.com