Well, I got such a good response from my last technical question that I'll try
again :)
If it's actually secure, it'll go really well with my credential system.
Trent generates primes p,q. He publishes n=pq and some random value g.
Trent calculates a and a' such that aa' = 1 % (p-1)(q-1) and
Jason Holt writes:
> Trent generates primes p,q. He publishes n=pq and some random value g.
>
> Trent calculates a and a' such that aa' = 1 % (p-1)(q-1) and a' is prime. He
> sends Alice a' and g^a%n. a' is her secret exponent and g^a%n her public
> value.
Another way to think of g^a is as the