Here it is: a simple Big Number library for unlimited use (Public Domain). Please make as many copies as you like, rip it, change it, enjoy it!

It's complete with source, Type Library, VB Test project, short english help, all what you need for Ketil's superb RadASM.

Have a look at the Algo-Thread, too, because it has been developed for a very special task. There is another BNLib in arrival (BCD encoded), which has been used mainly for verifying the single steps of the RSA research and gives a human (and decimal) feedback to big number calculations. I'm sorry I can't attach it today, I've to write first some help in english.

Giovanni

PS: Thanks a lot for the latest feedback. :)
Posted on 2002-05-06 12:58:10 by sch.jnn
No attachment :)
Posted on 2002-05-06 13:00:58 by bazik
Can he get a drum roll please... :tongue:
Posted on 2002-05-06 13:09:42 by bitRAKE

No attachment :)


HOW COULD THIS HAPPEN??? :(

There was no error message, everything ok?

I try again here.

Giovanni
Posted on 2002-05-06 13:10:18 by sch.jnn
YES.
Posted on 2002-05-06 13:12:03 by sch.jnn
Perhaps your attachment problem was the 'preview post' thingy?
Iirc it forgets about your attachments if you preview posts, or something
like that.
Posted on 2002-05-06 13:22:48 by f0dder
Giovanni, looks like a solid design, but slow as all hell for what your using it for. :) Your knowledge of MASM seems really good - very pretty code.
Posted on 2002-05-06 21:42:57 by bitRAKE
you should do sqrt function . and sqr function .
maybe even x^(2n)


bye

eko
Posted on 2002-05-07 03:31:29 by eko

you should do sqrt function . and sqr function .
maybe even x^(2n)


Please give me an example how *you* would solve a simple sqrt, sqr and x^(2n) function with (D)WORD integers. I like to see how others do.

For example: eax = SQRT(100) (...)

Giovanni
Posted on 2002-05-07 08:19:23 by sch.jnn

Giovanni, looks like a solid design, but slow as all hell for what your using it for. :) Your knowledge of MASM seems really good - very pretty code.


Thanx. You make me flush.

You're right, it's terribly slow. But it flashing fast for what I am using it for (only adding and multiplying is required).

Giovanni
Posted on 2002-05-07 08:23:18 by sch.jnn
Here is the other library. It's not that cured as the BinLib, but has a big advantage: No special converting is required.

Public domain, and this time I try not to fail with the upload :)

Giovanni
Posted on 2002-05-08 14:37:18 by sch.jnn
Thank you. Have you seen Roy's binlib?:
http://www.effervescence.com/fleur/index.htm
Posted on 2002-05-08 14:48:12 by bitRAKE

Please give me an example how *you* would solve a simple sqrt, sqr and x^(2n) function with (D)WORD integers. I like to see how others do.

I suggest you to have a look at "High Speed RSA Implementation" by Cetin Kaya Koc (RSA Laboratories) - (oh no, that nasty R-word again... ;) )
Posted on 2002-05-08 16:30:48 by Tola
Ok, this one is much better and makes it completely unnecessary to use the BCDLib :)

There are many new functions (bit manipulation, sqrt, n!) and many became flashing fast (compared to the first release).

Have fun,

Giovanni
Posted on 2002-06-16 11:24:12 by sch.jnn