Re: Computing big numbers
 From: "Tom St Denis" <tomstdenis@xxxxxxxxx>
 Date: 9 Jan 2006 07:06:37 0800
Pubkeybreaker wrote:
> toorandom@xxxxxxxxx wrote:
> > Hi, im new in this group and i hope my question can be new too (i doubt
> > that) , im implementing a big number library , i have made sums and
> > multiplications with big numbers.
> > i need to do this for a microcontroler to have the ability of
> > publickey algorithms.
> > maybe discret log , i would like to implement modulus , i can implement
> > my current work without modulus... but it will be better and ill
> > restrict my bandwidth if i make this. but im having problems , does
> > anybody know a good starting website or how can i search in google for
> > big number arithmetic in computers, i have search , but with no
> > success, GMP is a little complex to understand , and if i made
> > multuplication and sum smaller than GMP i think modulus will be much
> > smaller
>
> Read Knuth, Vol 2.
Knuth vol2 isn't exactly complete for what you need to do crypto math
on say a microcontroller. Actually iirc it doesn't cover a lot of what
you need to know like fast reduction, or multiplications [other than
interpolation based stuff].
vol2 is a good starting point I agree but not what an implementor
needs. It's more of what a student needs.
Tom
.
 FollowUps:
 Re: Computing big numbers
 From: stan
 Re: Computing big numbers
 References:
 Computing big numbers
 From: toorandom@xxxxxxxxx
 Re: Computing big numbers
 From: Pubkeybreaker
 Computing big numbers
 Prev by Date: How to construct oneway permutation from oneway function?
 Next by Date: Re: Computing big numbers
 Previous by thread: Re: Computing big numbers
 Next by thread: Re: Computing big numbers
 Index(es):
Relevant Pages
