Re: Generator of a group
From: Phil Carmody (thefatphil_demunged_at_yahoo.co.uk)
Date: 01/06/05
- Next message: Phil Carmody: "Re: A theoretical method to brute force 128 bit RSA in arbitrary time."
- Previous message: Phil Carmody: "Re: Generator of a group"
- In reply to: Mok-Kong Shen: "Re: Generator of a group"
- Next in thread: Tom St Denis: "Re: Generator of a group"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 06 Jan 2005 03:40:28 +0200
Mok-Kong Shen <mok-kong.shen@t-online.de> writes:
> Gregory G Rose wrote:
> > Tobias Ruske <tobias.ruske@arcor.de> wrote:
>
> > >No panic, that isn't a homework problem, but I want to implement
> > an >crypto-algorithm. My present solution is: I search for a
> > generator of >the group of (Z_p)^* ,because this is a generator of
> > QR_p, too, or?
> > >Can you help me with a complete algorithm?
> > If x generates Z_p*, then x^2 generates QR_p, I
> > think.
>
> On the other hand, I suppose to find x^2 as a generator
> of QR_p this way could be less efficient than via the direct
> way as given in HAC 4.80.
I think the difference is utterly negligible, but if there were
to be a difference it would be the opposite way round.
Do you have any logic to back up your unfounded supposition?
I can justify mine quite simply, for reference, but you claimed
first, so you show first.
Phil
-- The gun is good. The penis is evil... Go forth and kill.
- Next message: Phil Carmody: "Re: A theoretical method to brute force 128 bit RSA in arbitrary time."
- Previous message: Phil Carmody: "Re: Generator of a group"
- In reply to: Mok-Kong Shen: "Re: Generator of a group"
- Next in thread: Tom St Denis: "Re: Generator of a group"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|