Re: A factoring algorithm

"Joseph Ashwood" <ashwood@msn.com> a écrit dans le message de
news:r8Yvf.72037$tV6.49382@newssvr27.news.prodigy.net...
> <hart_wb@yahoo.com> wrote in message
> news:1136613824.569396.118650@o13g2000cwo.googlegroups.com...
> > I have a new factoring algorithm which seems to be very fast with
> > certain kinds of numbers.
>
> Any advances, or even new paths in factoring is always a welcome advance.
If
> your algorithm is as fast as you say, it is likely that new qualifications
> may need to be created for RSA keys, this is a well established area of
> advancement, and will be appreciated. Even if it results in triviality as
> Amling and Carmody have said the knowledge the an additional avenue is
> available is often very useful.
> Joe
>
>

Hello

I apologize in advance because I will probably make incorrect statements or
it is perhaps not related to the subject of this thread.
But I have always been astonished by the processing speed of smartcard with
respect to OpenSSL on a modern PC.
I have made comparison and smartcard are supposed to be 20 times slower than
a Pentium IV (1.9 GHz).
As smartcard use very slow processors (at best 32 bits at 20 Mghz) and use
only a few milliwats of power, it is strange to me that it can be so close
to CPU running at a frequency 75 times higher and using power that is more
than 1000 times higher.

This means that smartcards might be 3.75 quicker than Pentium IV at the same
clock frequency. Perhaps that smartcards manufacturers have very optimised
programs, but I was wondering if smartcard manufacturers could have used
algorithms to generate RSA keys belonging to sets that could be processed
more quickly than standard RSA keys?

Do you think that such algorithms might be possible and unknown to the
academic community?

Jean-Pierre
Received on Tue Jan 17 16:49:06 2006