Re: Factorization polynomially reducible to discrete log - known fact or not?

2006-07-12 Thread Peter Kosinar
(N) if g was a generator of the multiplicative group Z_N^*. Peter -- [Name] Peter Kosinar [Quote] 2B | ~2B = exp(i*PI) [ICQ] 134813278 - The Cryptography Mailing List Unsubscribe by sending unsubscribe cryptography to [EMAIL

Re: Factorization polynomially reducible to discrete log - known

2006-07-12 Thread Peter Kosinar
on the factorization of phi(N) which, in turn, might depend on the process used to choose the factors of the modulus (e.g. sometimes-suggested approach of using Sophie-Germain primes creates abundance of generators; whereas some primorial-like construction might decrease it). Peter -- [Name] Peter Kosinar