CJBIRKIN
Drink!
- Local time
- Today, 13:36
- Joined
- May 10, 2002
- Messages
- 256
Hi,
I've written an encryption algorithm that requries the multiplication of 2 large (32+ character) integers.
say IntA and IntB
My problem is i need to retain the indivdual characters that are created by the muliplication of IntA and IntB, the programme uses the 1.0^X notation as soon as i do the multplication.
If i try to do the division of the mulitplication product of IntA and IntB (IntC) i do not get back the original number i.e. IntC/IntA ~ IntB.
Is there a way round this?
Cheers
Chris
I've written an encryption algorithm that requries the multiplication of 2 large (32+ character) integers.
say IntA and IntB
My problem is i need to retain the indivdual characters that are created by the muliplication of IntA and IntB, the programme uses the 1.0^X notation as soon as i do the multplication.
If i try to do the division of the mulitplication product of IntA and IntB (IntC) i do not get back the original number i.e. IntC/IntA ~ IntB.
Is there a way round this?
Cheers
Chris