Sign In
Create Account
Follow Us on Twitter
Subscribe on Youtube
im writing RSA algo, so if you have any good idea to do that im listening.
i will use modexp method, (exponent = number of iterations for mul and div)
multiplication is easy, but division gives me nightmares. Seriously, soon it will be a MONTH since i try to solve it.
i have few methods, like divide by 1st part of divisor, mul this by divisor and sub from divident, but this is too complicated for me, for now... Maybe ill understand it in some time.
How do i divide 2 large ammounts of data. All i need is modulo, not division result!
HELP ME PLZ
division, 2048 bits by 1024
Started by
Guest_h4x_*
, Jul 27 2009 02:04 PM
3 replies to this topic
Back to top|
|
|
#2
Posted 27 July 2009 - 02:38 PM
WingedPanther
-
- Moderators
-
- 16,831 posts
A spammer's worst nightmare
What language/libraries have you been using?
#4
Posted 28 July 2009 - 06:07 AM
WingedPanther
-
- Moderators
-
- 16,831 posts
A spammer's worst nightmare
Most languages (Java, C, C++, C#) have large integer libraries that can do this for you. I use GMP for C/C++ quite a bit. Most of the library is probably asm, so that may help you out (it's open-source).
