Re: Is it a hard problem?
- From: fbloveu@xxxxxxxxxxx
- Date: 13 Jan 2006 14:48:45 -0800
If I don't know p or q, is it a hard problem? And what is the attack
against the sub-group generated by p, Is Discrete Log Problem not hard
in Z_p?
.
- References:
- Is it a hard problem?
- From: fbloveu
- Re: Is it a hard problem?
- From: Tom St Denis
- Is it a hard problem?
- Prev by Date: Re: Computing big numbers
- Next by Date: Re: A New Encryption Algorithm
- Previous by thread: Re: Is it a hard problem?
- Next by thread: Re: Is it a hard problem?
- Index(es):
