Re: RSA

[tom st denis <tomstdenis@yahoo.com>]

--- kartikey bhatt <kartik_me@hotmail.com> wrote:
> hey i am gonna look at the code right now.
> will keep in touch.
> 
> "Tom has indicated a few ways to go about this which I will send
> you."
> waiting for details.

Um to clear up something here.  Joy and Serge are going to be the
developers on this module.  I'm just helping out where I can with my
knowledge of crypto/math/LibTom internals.  

Specifically a good starting place is to rip "mpi.c" out of LibTomCrypt
and start stripping it down.  You don't need things like the
Karatsuba/Toom-Cook multipliers, Jacobi symbol, various prime functions
[next_prime, fermat testing, etc].  You won't need the diminished radix
and Barrett reduction algorithms, etc, etc, etc.

In a recent project [see my C.V. for details] I managed to get a
"optimized for size" mpi.c down from 29KB to 5KB on an x86 with GCC.

Naturally this won't be that small since you want to leave in things
like the Comba mult/sqr algorithms and the full exptmod routine.  But
definitely around 7-10KB is possible on the x86.  

Then of course you have the RSA routines on top of that.  Depending on
whether you need PKCS #1 v2 or v1.5 you can do one of two things.  I
have both v2 and v1.5 padding in LibTomCrypt [and specifically in the
v0.97 release I reduced the stack usage to way south of 4KB].  So if
you're using v1.5 you'll have to write your own rsa encrypt/sign code
[I have a key-gen and CRT optimized exptmod you can rip off].  

On the plus side all of my code is ISO C portable, thread safe and well
tested [been used by quite a few people].  There are enough goodies in
LibTomCrypt to make this happen and you're all entitled to
rip/relicense as required ;-)

Tom


		
__________________________________
Do you Yahoo!?
Yahoo! Mail - Helps protect you from nasty viruses.
http://promotions.yahoo.com/new_mail