Re: Faster way to use RSA...
From: Beta-Ray Bill (nSePtAnMeSwUsC@KaSttbi.com)
Date: 04/02/03
- Next message: Brian Gladman: "Re: Cohen's paper on byte order"
- Previous message: Erwann ABALEA: "Re: Leopard10 source code update"
- In reply to: Tom St Denis: "Re: Faster way to use RSA..."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
From: "Beta-Ray Bill" <nSePtAnMeSwUsC@KaSttbi.com> Date: Wed, 02 Apr 2003 09:53:12 GMT
Very good point!!!
Obviously I will be doing more research.
Thanks,
"Tom St Denis" <tomstdenis@yahoo.com> wrote in message
news:2jeia.77$pNv.35@news02.bloor.is.net.cable.rogers.com...
>
> "Beta-Ray Bill" <nSePtAnMeSwUsC@KaSttbi.com> wrote in message
> news:HQ8ia.27618$OV.127611@rwcrnsc54...
> >
> > I see from your explaination that perhaps that P and Q could not be made
> > small enough to
> > compete with AES ( speed being the key ) and be reliable. My only
interest
> > in RSA was to achieve the
> > minimal necessary security and increase its speed even if I had to use
> > (abuse?) it as a symetrical
> > medthod. Recovering the value from its remainder is elegant. I want to
> > explore a dynamic RSA type
> > system where a new e and d pair could be created for each value to be
> > encrypted.
>
> To what advantage? I mean what is the benefit of using RSA where you have
> to initially share a secret like that?
>
> Why not just use Pohlig-Hellman?
>
> Tom
>
>
- Next message: Brian Gladman: "Re: Cohen's paper on byte order"
- Previous message: Erwann ABALEA: "Re: Leopard10 source code update"
- In reply to: Tom St Denis: "Re: Faster way to use RSA..."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|