NODE 43125dc1Re: Unofficial Release
trollins@telos.com (Tom Rollins)Wed, 22 Jun 94 16:59:59 PDT
Parry says:
>Because it isn't cheap, first of all. If you wanted to run a
>completely secure internet, for example (a problem I am currently
>working on) the cost of all those RSAs really DOES show up, and fast.
Parry, It looks like you have your own agenda in which large rsa keys
doesn't fit your time constraints.
Don't implement large keys for your secure net.
And don't convince yourself that it be COMPLETELY SECURE.
-tom
NODE 610e57d9Re: Unofficial Release
"Perry E. Metzger" <perry@imsi.com>Thu, 23 Jun 94 04:58:13 PDT
Tom Rollins says:
> Parry says:
> >Because it isn't cheap, first of all. If you wanted to run a
> >completely secure internet, for example (a problem I am currently
> >working on) the cost of all those RSAs really DOES show up, and fast.
>
> Parry, It looks like you have your own agenda in which large rsa keys
> doesn't fit your time constraints.
> Don't implement large keys for your secure net.
> And don't convince yourself that it be COMPLETELY SECURE.
It will be no less secure than one using larger keys. This point is
lost on you, of course.
Perry
NODE ab6ba140Re: Unofficial Release
Phil Karn <karn@qualcomm.com>Thu, 23 Jun 94 18:03:46 PDT
Rumor has it that certain government applications do Diffie Hellman
with 2K-bit moduli. Given the apparent connections between factoring
and discrete logarithm (the complexity formulas seem to look very much
alike), it appears that at least one user feels that keys longer than
1K bits provide a desirable safety margin.
Phil