[13117] in cryptography@c2.net mail archive
two number theory questions
daemon@ATHENA.MIT.EDU (Steve Zhang)
Mon Apr 28 12:03:40 2003
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Thu, 24 Apr 2003 20:49:46 -0700 (PDT)
From: Steve Zhang <steve9482003@yahoo.com>
To: cryptography@metzdowd.com
Hi,
I have two number theory questions:
Question #1:
Assume that p is a large prime and g is a generator.
Given y=g^b mod p but no b (that is, b is unknown), are there efficient algorithms to compute z=g^{b^{-1}} mod p?
Question #2:
Assume that p is a large prime and g is a generator.
Given y=g^{b^2} mod p but no b (that is, b is unknown), are there efficient algorithms to compute z=g^b mod p? How about computing y from z (b is still unknown)?
Thank you.
Steve
---------------------------------
Do you Yahoo!?
The New Yahoo! Search - Faster. Easier. Bingo.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
