Hi professors...
I'm a student studying cryptography and e-cash. I've been wondering, why
many cryptographic protocols based on discrete log problem such as Schnorr,
Brand's e-cash, Chaum & Pedersen's DLP blind signature, etc, we must choose
a prime q & p where q divides (p-1)? q is the exponentiation modulo and p is
the 'equation modulo'.
Does it has something to do with Pollard (p-1) ?
Thank you very much.
Sincerely,
-mukti
========================================
Check out my homepage: www.geocities.com/SiliconValley/8972
> biodata, resumes, hobby, words of wisdom
> Indonesian E-Commerce Resource Website (bahasa Indonesia)
www.geocities.com/SiliconValley/8972/resource.html
electronic payment systems, Indonesian e-commerce law,
credit card crimes in the Internet (you should know!), etc...
