Re: Breaking RSA & Securing RSA

From: Michael Scott (mscott_at_indigo.ie)
Date: 07/06/05


Date: Wed, 06 Jul 2005 19:07:12 +0100

Sebastian Gottschalk wrote:
> Galathas wrote:
>
>
>> 8. Any other ideas ??
>
>..snipped
>
> - RSA over ECC can use smaller key sizes, as factoring over ECC is way
> harder.

Er... What? What is "factoring over ECC"? Factoring a composite doesn't
get harder depending on what you use it for.

Mike Scott

>
>
>>5. note: Finally, what are the most effective algorithms while
>> finding e and d ( i mean when calculating equation
>> (e*d) mod (phi(n)) = 1 and looking for d )? May you please
>> post it here, or post link to description of such algorithm?
>
>
> It's called Advanced Euklid's Algorithm and is so simple that you can't
> miss it.